1. (12pt) Formulate the following networks problems as linear programs. The resulting LP does not need to be in standard or canonical form. You do not need to solve these problems (a) Minimum cost flow for the following network. The numbers in the nodes are of the form (label,supply/demand). The numbers on arcs are of the form (cost,capacity): (3,3) (3,6) (3,5) (6,2) (2,3)(4,2) (4,3) (3,2) (b) Shortest path from node 1 to node 6. The numbers on arcs are the costs 6 4 c) Maximum flow from node 1 to node 7. The numbers on arcs are the capacities 6 1. (12pt) Formulate the following networks problems as linear programs. The resulting LP does not need to be in standard or canonical form. You do not need to solve these problems (a) Minimum cost flow for the following network. The numbers in the nodes are of the form (label,supply/demand). The numbers on arcs are of the form (cost,capacity): (3,3) (3,6) (3,5) (6,2) (2,3)(4,2) (4,3) (3,2) (b) Shortest path from node 1 to node 6. The numbers on arcs are the costs 6 4 c) Maximum flow from node 1 to node 7. The numbers on arcs are the capacities 6