Walks, Paths and Connectivity · Medium problem

A wheel graph has a hub vertex $0$ joined to every vertex of a $4$-cycle $1\text{-}2\text{-}3\text{-}4\text{-}1$ (edges $12,23,34,41,01,02,03,04$). How many triangles does this graph contain?