Expected Cover Time of the Cycle C₆

A simple random walk moves on the cycle graph $C_6$ (vertices $0, 1, \ldots, 5$). At each step, the walker moves clockwise or counterclockwise with equal probability. Starting at vertex $0$, what is the expected number of steps to visit all $6$ vertices (the expected cover time)?