[1 point} a} State the number of edges in the complete graph Kg, where each pair of distinct vertices is adjacent. [2 points} b] Let G be a simple graph with 3 vertices where each vertex has degree 3. Form the graph H by replacing each edge pr with a nonedge, and each nonedge between distinct vertices of G with an edge. What is the number of edges in H? Explain your answer. [2 points) :1 Explain why there cannot exist a simple graph of order 11, where the vertices have degrees 1, 1r 2, 2; 2, 2, 3, 4, 4, , 5