A planar, bipartite graph G is called maximal if the addition of any edge to G creates a K3 or causes it to be non-planar. a. Show that if G is a maximal planar bipartite graph (with order n >2) then every region is a 4-cycle b. Show that in G, 2q = 4r c. Use Eulers identity to show if G is a planar and bipartite, q 2n 4 d. Prove K3,3 is not planar