(2) In this question, K6 denotes the complete graph, K3; the complete bipartite graph, and W6 the wheel graph, all with 6 vertices. Mark each of the following true or false: (a) None of the graphs K6, K33, W5 is semiEulerian. (b) The graph G consists of the complete graph K6 minus one edge. Then G' is Hamiltonian. ((3) Any simple graph with 6 vertices and degree sequence (3, 3, 3, 3, 3, 3) has chro matic number equal to 2 or 3. (d) All three of the graphs K5, K33, W5 possess a 5-cycle. (e) The chromatic numbers of the three graphs K5, K33, W5 are all different