Expected Return Time on the Complete Graph K₄

A simple random walk moves on the complete graph $K_4$ (four vertices, every pair connected). At each step, the walker moves to one of the $3$ neighbors chosen uniformly at random. Starting at a vertex $v$, what is the expected number of steps to return to $v$ for the first time?