Hitting Time on the Path Graph P₅

A simple random walk moves on the path graph $P_5$ with vertices $\{0,1,2,3,4\}$ and edges connecting consecutive vertices. At the interior vertices ($1, 2, 3$), the walker moves left or right with equal probability $\tfrac{1}{2}$. At the endpoints ($0$ and $4$), the walker moves to the unique neighbor with probability $1$. Starting at vertex $0$, what is the expected number of steps to reach vertex $4$ for the first time?