Hitting Time with Skip Transitions

A Markov chain on $\{0, 1, 2, 3, 4\}$ has the following transition rules. From state $i$ with $1 \le i \le 3$: move to $i-1$ with probability $\tfrac{1}{2}$, and move to $i+1$ with probability $\tfrac{1}{2}$. From state $4$: jump to state $2$ with probability $1$. State $0$ is absorbing.

Compute $E[T_0 \mid X_0 = 2]$, the expected number of steps to reach state $0$ starting from state $2$.