J 1

Prove or disprove the following statements concerning graphs.

a) There exists a graph with 9 vertices such that all vertices have degree 5.

b) The complete graph K10 has exactly 45 edges.

c) There exists a graph G with 10 vertices that has 5 vertices with degree 2, 5 vertices with degree 4, and G is not connected.