Walks, Paths and Connectivity · Challenge problem

$K_{3,3}$ has parts $\{1,2,3\}$ and $\{4,5,6\}$, with every cross edge present. How many walks of length $4$ are there from vertex $1$ to vertex $2$ (both in the same part)?