A simple graph is called n-regular if every vertex of the graph has degree n.

Show that if a bipartite graph G = (V, E) with a bipartition of the vertex set (V1, V2) is n-regular for some positive integer n then |V1| = |V2|.