Reconsider Problem $9\mathrm{.}7.$ Suppose now that, for administrative convenience, management has decided that all $130$ units per month needed at the distribution center in Los Angeles must come from the Stuttgart factory $($node ST$)$ and all $50$ units per month needed at the distribution center in Seattle must come from the Berlin factory $($node BE$).$ For each of these distribution centers, Karl Schmidt wants to determine the shipping plan that will minimize the total shipping cost.

For the distribution center in Los Angeles, formulate a network model for this problem as a minimum$-$cost flow problem by inserting all the necessary data into the distribution network shown in Figure $9\mathrm{.}6.($Use the format depicted in Figure $9\mathrm{.}3$ to display these data.$)$

Page $400$

Formulate and solve a spreadsheet model for the problem formulated in part a$.$

For the distribution center in Seattle, draw its distribution network emanating from the Berlin factory at node BE$.$

Repeat part a for the distribution center in Seattle by using the network drawn in part c$.$

Formulate and solve a spreadsheet model for the problem formulated in part d$.$

Add the total shipping costs obtained in parts b and e$.$ Compare this sum with the total shipping cost obtained in part c of Problem $9\mathrm{.}7($as given in the back of the book$).$

please show an actual spreadsheet formulated, including solver.