Formulate a linear program for the problem in Question 1. Solve your formulation with Pyomo. Provide a screenshot of the code and the solution.

10.5-1. For the network shown below, use the augmenting path algorithm described in Sec. 10.5 to find the flow pattern giving the maximum flow from the source to the sink, given that the arc capacity from node i to node j is the number nearest node i along the arc between these nodes. Show your work. 1. Problem 10.5-1. After implementing the augmenting path algorithm and finding the maximum flow, find the minimum cut as well