Hitting Time on the Complete Graph K₅

A random walk moves on the complete graph $K_5$ (five vertices, every pair connected). At each step, the walker moves to one of the $4$ neighbors chosen uniformly at random. Starting from vertex $u$, what is the expected number of steps to reach a specified vertex $v \neq u$ for the first time?