For the minimum-cost flow model given in Exercise 22, suppose that the spanning tree indicated by the solid lines in the following network, along with the dash–dot arcs at their upper bounds, has been proposed as a solution:
a) What are the flows on the arcs corresponding to this solution?
b) Determine a set of shadow prices for the nodes.
c) Show that this solution is optimal.
d) Is the optimal solution unique