Walks, Paths and Connectivity · Challenge problem

In $K_4$ (vertices $1,2,3,4$, every pair joined), a closed trail of length $3$ at vertex $1$ uses $3$ distinct edges, starts and ends at $1$, and may be traversed in either direction around a triangle. How many closed trails of length $3$ start and end at vertex $1$?