During the next two months, Machineco must meet (on time) the demands for three types of products shown in the following table. Month Product 1 Product 2 Product 3 1 50 units 70 units 80 units 2 60 units 90 units 120 units Two machines are available to produce these products. Machine 1 can only produce products 1 and 2, and machine 2 can only produce products 2 and 3. Each machine can be used for up to 40 hours per month. Following table shows the time required to produce one unit of each product (independent of the type of machine); the cost of producing one unit of each product on each type of machine; and the cost of holding one unit of each product in inventory for one month. Product 1 2 3 Production Cost ($) Production Time (minutes) | Machine 1 Machine 2 30 40 20 60 15 55 45 Holding Cost ($) 15 10 5 Formulate a minimum cost network flow problem that could be used to minimize the total cost of meeting all demands on time. A formulation requires drawing the appropriate 1 network and determining the ci's, bi's and the arc capacities. You do not have to write down the formulation explicitly