Recall that a network is regular if all of its vertices have the same degree,

that is$,$ the same number of edges incident to them. Suppose that $G$ is a

regular bipartite network where all nodes have degree $d1.$ Show that

the edges of $G$ can be decomposed into $d$ disjoint perfect matchings.