Draw two non-isomorphic graphs with degree sequence 0, 1, 1, 2, 2, 2. Determine whether the following two graphs are isomorphic. FULLY JUSTIFY your answer. 3 a XNX Let G be a graph with n vertices that is isomorphic to its complement G. Determine the number of edges e of G. [4 + 6 + 4 = 14] Is it possible to have a connected planar graph containing six vertices with degree sequence 3, 3, 5, 5, 5, 57 FULLY JUSTIFY your answer. [6]