Walks, Paths and Connectivity · Superchallenge problem

A "book" graph has spine vertices $0,1$ joined directly, plus $4$ pages $2,3,4,5$ each joined to both $0$ and $1$. How many closed trails of length $4$ (no repeated edge) start and end at vertex $0$?