Draw a connected planar graph(with no loops or multiple edges) for each of the following properties, if possible. if not possible, explain briefly why not.13 edges and 9 regions(how many vertices must there be) 18 edges, and all vertices of edges 3;(how many vertices and regions must there be). Has at least 7 vertices, has no Euler cycle and requires exactly 3 colors to properly color