Hitting Time on the Wheel Graph W₆

The wheel graph $W_6$ consists of a central hub $h$ connected to all $5$ vertices of a cycle $C_5$ (so $h$ has degree $5$ and each rim vertex has degree $3$: two cycle neighbors and the hub). A simple random walk moves at each step to a uniformly random neighbor. Starting from a rim vertex $v$, what is the expected number of steps to reach the hub $h$?