Recall that a graph G is said to be k-regular if and only if every vertex in G has degree k. Draw all 3-regular simple graphs with 12 edges (mutually non-isomorphic). Hint: there are six of them. To receive credit for this problem, you should explain, as well as possible, why all of your graphs are mutually non-isomorphic.