Challenge Problem!!!

Let G be a simple planar graph containing no triangles.

(i). Using Euler's formula, show that G contains a vertex of degree at most 3.

(ii). Use induction to deduce that G is 4-colorable.

(iii). Try to prove the four-color theorem by adapting the above proof of the five-color theorem. At what point does the proof fail?