Let G be a connected simple planar graph with m edges and n vertices, n 23. (a) Suppose G is cubic and each face of G is of degree at least 4. (i) Show that G has at least 6 faces. (b) (ii) If G has exactly 6 faces, find m and n. Hence, draw the graph G. (i) Give the relation (inequality) between m and n if G has a face which is not a triangle. (ii) Prove that cr(K233)24. Let G be a connected simple planar graph with m edges and n vertices, n 23. (a) Suppose G is cubic and each face of G is of degree at least 4. (i) Show that G has at least 6 faces. (b) (ii) If G has exactly 6 faces, find m and n. Hence, draw the graph G. (i) Give the relation (inequality) between m and n if G has a face which is not a triangle. (ii) Prove that cr(K233)24