Markov Chains & Long-Run Behavior · Superchallenge problem

A random walker on the six vertices of a regular hexagon steps to one of the two adjacent vertices with probability $1/2$ each. What is the expected number of steps until every vertex has been visited at least once (the starting vertex counts as visited)?