Suppose that G = (V, E) is a loop-free planar graph with | V | = v, | E | = e, and k (G) = the number of components of G.
(a) State and prove an extension of Euler's Theorem for such a graph,
(b) Prove that Corollary 11.3 remains valid if G is loop-free and planar but not connected.