Problem 2: You are given two bipartite graphs G and H below. For each graph determine whether it has a perfect matching. Justify your answer, either by 1. listing the edges that are in the matching or 2. using Hall's Theorem to show that the graph does not have a perfect matching Problem 2: You are given two bipartite graphs G and H below. For each graph determine whether it has a perfect matching. Justify your answer, either by 1. listing the edges that are in the matching or 2. using Hall's Theorem to show that the graph does not have a perfect matching