Isomorphism and Subgraphs · Challenge problem

The $3$-dimensional hypercube $Q_3$ has vertices $\{0,1\}^3$ with an edge between strings differing in exactly one coordinate ($12$ edges total). How many $4$-element subsets of its $8$ vertices induce a subgraph isomorphic to $C_4$?