2 TRANSPORTATION ALGORITHM Solve the transportation problem for each of the following two models. The number in the cell is the cost, the number left of each row is the supply and the number below each column is the demand. Problem A Problem B 12 5 5 10 24 8 2 0 110 438 4 235 1 0 2 9 10 9 i) Formulate both problems A and B as linear programs. (20 points) ii) For each problem A and B, start with a feasible solution generated using all three methods: Northwest-corner, Least-cost, and VAM. (60 points) iii) For each problem A and B, select the best starting solution from (ii) then find the optimal solution. Show all the steps. (20 points) S 5 7 6