1. What is a linear program? Explain in at least one paragraph. Provide a concrete example.
2. What are constraints in linear programming problems? Offer at least one example.
3. What is an optimization problem? Offer an example and explain.
4. What is a reduction (specifically, changing one problem into another)? Provide an example.
5. 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.
6. Once you complete question 5, use the already known linear program that solves the maximal flow problem.