Graph Theory Question

Solution:

The answer requires full JUSTIFICATION along with full WORKING out.

Please answer the full question correctly for thumbs up.

1. A simple graph in which each pair of distinct vertices is joined by an edge is called a complete graph. We denote by Kn the complete graph on n vertices. A simple bipartite graph with bipartition (X, Y) such that every vertex of X is adjacent to every vertex of Y is called a complete bipartite graph. If IXI = m and IY-n, we denote this graph with Km, How many edges does Kn have? How many edges does mn have