Transform the matching problem into a maximal flow problem

1. Given Example 10.4.4 and Theorem 10.4.5 in the textbook, explain how you would transform the matching problem into a maximal flow problem.

2. Once you complete question 1 use the already known linear program that solves the maximal flow problem. Show all of your work and how you are doing the reduction.