Prove: Let G be a planar graph that has n vertices, e edges, r regions, and k (connected) components. Show that the Euler's Formula for G can be written as: n-e+r = k+1. (Note that if G is connected, then k = 1 and Euler's Formula is degenerated to n-e+r = 2.)