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