Hard Problem!!!

Let G be a simple graph with fewer than 12 faces, in which each vertex has degree at least 3.

(i). Use Euler's formula to prove that G has a face bounded by at most four edges.

(ii). Give an example to show that the result of part (i) is false if G has 12 faces.