Problem 2: Generalize and prove Euler's Formula to planar graphs that are not connected: Let G be a planar graph with n vertices, m edges, f faces, and k components. Then f = m – n + k + 1.