Consider the min-cost max-flow problem where we have 6 nodes (a,b,c,d,e,f), with supply on nodes (b, e, f) Sb = 3, Se = 5, Sf = 2 and demand on nodes (c, d) Sc = -4, sd = -6 The network has 9 arcs (a, c), (a,d), (b, a), (b, c), (c, e), (d, b), (e, a), (f,b), (f, d) with associated costs Cac = O, Cad = 1, Cba = 8, Cbc = 3, Cce = 2, Cdb = 5, Cea 5, Cea = 2, Cfb = 0, Cfd = 10 1. Draw the network corresponding to this description, and formulate this min-cost flow problem as an LP as we did in class. 2. Show a feasible solution of the problem. (You do not need to solve it for an optimal solution). 3. (Bonus question) Suppose there is more supply than demand. Can you think of an alternative method to the one described in the lecture notes to deal with this issue?