We have three reservoirs with daily supplies of 15, 20, and 25 million liters of water, respectively. On each day we must supply four cities E, F, G, and H whose demands are 8, 10, 12, and 15, respectively. The cost of pumping per million liters is given in the table below. Setup a minimum cost network flow problem that can be used to determine the cheapest pumping schedule if excess water can be disposed of at no cost. Part 1: Draw the network and determine & label the net outflow at each node, the arc capacities, and the arc costs. Hint, you should be able to do this with 8 nodes.

Cost	Cost	Cities
Cost	Cost	A	B	C	D
Reservoirs	1	2	3	4	5
	2	3	2	5	2
	3	4	1	2	3