You are given an undirected graph with 11 nodes. From every node, you are able to access any other node (not including itself), all with an equal probability of 1/10. What is the expected number of steps to reach all nodes at least once (rounded to the nearest step)?
