(i) prove that every r-regular bipartite multigaph where $\displaystyle r \geq 1$ has a perfect matching

(ii) use part (i) to prove that every r-regular bipartite multigraph where $\displaystyle r \geq 1$ has a 1-factorisation