The blood bank wants to determine the least expensive way to transport available blood donations from Pittsburgh and Staunton to hospitals in Charleston, Roanoke, Richmond, Norfolk, and Suffolk. The supply and demand for donated blood is shown in figure 5.36, along with the unit cost of shipping and along each possible arc.

Question: Supose that no more than 1,000 units of blood can be transported over any one arc. What is the optimal solution to this problem? Please show the formulas you enter in excel to solve this problem.

blood donations from Pittsburgh and Roanoke, Richmond, Norfolk, and Suffolk. The supply and demando blood is shown in Figure 5.36 along with the unit cost of shippingaoona 16. The blood bank wants tu along each possible arc. 800 300 Richmond Pittsburgh Charleston -1,300 1 Suffolk 400 Roanoke 200 Norfolk 700 a. Create a spreadsheet model for this problem. b. What is the optimal solution? C. Suppose that no more than