Solve the question given below
Prove the following statement using Hall's Theorem. For any bipartite graph G=(U, V, E), if every node (either a left node or a right node) has exactly d neighbors, where d is an arbitrary number between 1 and n, then G has a perfect matching.
The response must be typed, single spaced, must be in times new roman font (size 12) and must follow the APA format.