Problem
1. Construct a bipartite graph with six nodes and eight edges that has a three-edge matching, or prove that none exists.
2. Suppose that vertices in a bipartite graph represent jobs and people and that each person is to be assigned to two jobs. Will reduction to network flow give an algorithm for this problem? Prove your answer.