Graphs and Degrees · Challenge problem

A $3$-regular bipartite graph has two parts of $7$ vertices each. How many pairs of its $14$ vertices are NOT joined by an edge?