show that if a simple graph G has K connected components and these components have n$1,$n$2,....$nNk vertices respectively, then the number of edges of G doesn't rxceed