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-colourable. (In fact, it can be proved that G is 3-colourable.)