4. (6 points) For n 2 2, a complete graph on n vertices (nodes) is a simple graph that contains exactly one edge between each pair of distinct vertices. Prove by induction that the number of edges in a complete graph on n vertices is given by the formula