Please work through this problem for me.

(a). Formulate a minimal cost network flow problem that can be used to minimize the cost of meeting demand.

(b). Write the LP formulation of the network problem in (a).

4. (30 points) Fordco produces cars in Detroit and Dallas. The Detroit plant can produce as many as 6,500 cars, and Dallas plant can produce as many as 6,000 cars. Producing a car costs $2,000 in Detroit and $1,800 in Dallas. Cars must be shipped to three cities. City 1 must receive 4,000 cars, city 2 must receive 4,000 cars, and city 3 must receive 3,000 cars. The cost of shipping a car from each plant to each city is given in the following table. At most, 2,200 cars may be sent from a given plant to a given city. To (5) From Detroit Dallas City 1 800 500 City 2 City 3 600 300 200 200