Diagonalization & Matrix Powers · Superchallenge problem

A walk on the complete graph $K_4$ (four vertices, every pair joined by an edge) moves along one edge per step. How many walks of exactly $10$ steps start at vertex $1$ and end at vertex $2$?