A$)[9$ points$]$ Suppose you have a supply chain network with two distributors, two warehouses and two customers where all arcs are possible within the network.

HINTS: This is like Example $31.$ I suggest you use this node numbering and input matrix to start your problem.

Unit shipping costs

To Distributor $1$ Distributor $2$ Warehouse $1$ Warehouse $2$ Customer $1$ Customer $2$

From Node $123456$

Distributor $11$ $$12$ $$11$ $$13$ $$17$ $$14$

Distributor $22$ $$12$ $$5$ $$3$ $$10$ $$11$

Warehouse $13$ $$1$ $$10$ $$6$ $$2$ $$12$

Warehouse $24$ $$4$ $$4$ $$3$ $$4$ $$7$

Customer $15$ $$5$ $$3$ $$1$ $$3$ $$5$

Customer $26$ $$6$ $$15$ $$2$ $$2$ $$3$

In addition, suppose that the Distributors have the following supplies$/$capacities:

Capacity $($Units$)$

Distributor $11000$

Distributor $21500$

And that the Customers have the following demands:

Demand $($Units$)$

Customer $1700$

Customer $21750$

Set up the spreadsheet model and solve to find the flows that minimize total costs of meeting demands