Let G be a connected 3-regular plane graph in which every vertex lies on one face of
length 4, one face of length 6 and one face of length 8.
(a) Determine the number of faces of each length as a function of n = n(G).
(b) Use Euler's formula and part (a) to determine the number of vertices, edges and faces of G.
Thanks for any help...