2.

Consider a graph G that has k vertices are k-2 connected components, for k >= 4. What is the

maximum possible number of edges in G? Prove your answer.