Exercise 1: Form the above-given graph, define the maximum flow problem as we did in class as a linear program...However, differently from what we did in class, identify two sources and one destination. The goal of your problem's to maximize the flow from both sources to the destination. Identify the two sources and the destination in your graph randomly, but they cannot be connected to each other directly! If the computation in the above-given graph results in a fully connected graph where two directly unconnected sources cannot be found, you must remove some of the edges of your choice to create a network appropriate for solving the maximum flow problem. Remember to state the assumptions you made in your answer.

2. Solve this linear system from Exercise 1 with Simplex (manually). Show the initial Simplex tableau and each following Simplex tableau and the final optimal solution.

A 5. 11 E 61 10 Ho 84 B 7 12 D 12 3