Undirected Graph Search I

Question

You are given a complete undirected graph with $N \geq 2$ nodes. You first select a uniformly random node to go to, and then each step after, you select to move to any of the nodes ($\textbf{including}$the one you are presently on) in the graph uniformly at random. Find the expected number of turns that are performed until you visit all of the nodes with $N = 100$ and round to the nearest integer.