5. (20 points) Let G be a bipartite graph with bipartition (A, B) where |A| = |B| = 2n. Suppose that |N(X)||X| for every X CA with |X|≤ n, and |N(Y)||Y| for every Y CB with |Y| ≤n. Prove that G has a perfect matching.