Suppose g is a planar graph that is not necessarily connected, as required in euler's formula (theorem 2). recall that a component his a connected subgraph of g with the property that there is no path between any vertex in h and any vertex of g not in h. (a) find the appropriate modification of euler's formula for a planar graph with c components. (b) show that the corollary is valid for unconnected planar graphs.