Graphs and Degrees · Challenge problem

How many $4$-cycles (closed paths through exactly $4$ distinct vertices, using $4$ of the graph's edges) does the complete bipartite graph $K_{4,4}$ contain?