Hitting Time on K₄ Minus One Edge

Take the complete graph $K_4$ on vertices $\{1,2,3,4\}$ and remove edge $\{1,4\}$. The resulting graph has $5$ edges, with $d(1)=d(4)=2$ and $d(2)=d(3)=3$. A simple random walk moves at each step to a uniformly random neighbor. Starting from vertex $2$, what is the expected number of steps to reach vertex $4$?