Consider the following graph G. 8 00 a (a) Determine (G), the chromatic number of G. Give a minimal colouring and a proof that a smaller number of colours is not possible. (6) (b) Use the circle-chord method to show that G is non-planar. Give a subgraph of G that is a K3,3 -configuration. (8) (c) Is G bipartite? JUSTIFY. (3) (d) Determine whether G has an Euler cycle or an Euler trail. (4) (e) Determine a breadth-first spanning tree with root h. a