This figure is the needed graph from previous problem

Problem:

(Note these are all for the same problem)

22 15 30 20 20 s 2 5 10 40 3 18 1) Formulate the minimum cut problem for the graph of Problem 3 (from nodes s to t), using both (MCP 1) and (MCP 2). The numbers on the arcs are the weights. (20 points) 2) Use Excel solver to solve both of them (i.e., [MCP 1) and (MCP 2]). (5 points) 3) Recall the "direct method" for the dual LP discussed in Lecture 7. Write the dual problem of [MFP 2] you got from Problem 3. For each constraint of [MFP2), explicitly indicate which dual variable is corresponding to this constraint. (20 points) 22 15 30 20 20 s 2 5 10 40 3 18 1) Formulate the minimum cut problem for the graph of Problem 3 (from nodes s to t), using both (MCP 1) and (MCP 2). The numbers on the arcs are the weights. (20 points) 2) Use Excel solver to solve both of them (i.e., [MCP 1) and (MCP 2]). (5 points) 3) Recall the "direct method" for the dual LP discussed in Lecture 7. Write the dual problem of [MFP 2] you got from Problem 3. For each constraint of [MFP2), explicitly indicate which dual variable is corresponding to this constraint. (20 points)