1. Consider the minimum cost flow problem shown below, where the b values (net flows generated) are given by the nodes, the Ci; values (costs per unit flow) are given by the arcs, and the ui; values (arc capacities) are given between nodes C and D. [20] A [0] 6 C 2 5 Arc capacities: A C: 10 B C: 25 Others: 0 B [10] D [0] 3 [-30] E (a) Now consider the following BF solution: Basic variables: xAB = 15, XAD = 5, xCE=25, XDE = 5; Nonbasic variables: XAC = 0, XBC = 25,xBD = 0. [20] [0] A C 25 5 25 [-30] 15 E 5 B D [10] [0] Use the optimality test to verify that this BF solution is optimal. What is the total cost of the optimal solution? (b) When you did the optimality test in part (a), what tells you that there are multiple optimal solutions (hint: pay attention to the AZ value)? Find another optimal solution.