Problem 1: A small milk processing company is committed to delivering milk to live supermarkets in the region. The company has four tanker trucks with the capacities and cost values given in the table below. Capacity (Barrel) 400 Cost (100L) 4.5 5.0 Truck 1 Truck 2 Truck 3 Truck 4 500 600 5.5 6.0 1100 Each supermarket's milk demand can be delivered by only one truck. However, a truck can serve more than one supermarket. The milk demand of the supermarkets is 100, 200, 300, 500 and 800 tons, respectively. Formulate the optimum milk distribution problem at minimum cost. Problem 2: The following represents an electrical power distribution network connecting power generating points Gto G4 with power consuming points C, through C. The arcs are undirected, i.e., power may flow in either direction. The generating capacities and unit costs are given by the following table. Generator G G G GA Capacity (thousands of KWH) 100 60 80 150 Unit Cost (s per thousands of KWH) 15 13.5 21 23.5 The power consumption for points through Cris 35K, 50K, 60K, and 40K respectively. There is no capacity limitation on the transmission lines and the unit cost of transmission is $11 per 1000 KWH on all lines. Note that supply exceeds demand. a Formulate the problem of finding the optimal power allocation as a minimum cost network flow problem (Hint: you may have to introduce additional arcs and/or nodes)