Let G be a simple, connected and planar graph which is not a tree. Then it must have at least one cycle. Let the number of regions of G be f. We delete an edge a of a cycle in G to obtain the simple, connected and planar graph G − a.
What is the number of regions of G − a ?