Given the transportation cost table:

$\backslash$table$[[\backslash$table$[[$Ware$],[$house$]],$A$,$B$,$C$,$D$,$E$,\backslash$table$[[$Capac$-],[$ity$]]],[1,4,7,3,9,6,200],[2,3,2,4,6,5,400],[3,5,6,2,5,3,600],[4,8,4,5,7,3,700],[\backslash$table$[[$Require$-],[$ment$]],600,400,500,100,300,]]$

a$.$ Find the initial sciution by the Northwest Corner

Rule.

b$.$ Find the transportation schedule that will minimize total shipping cost. Use MODI.

Hints: Watch for degeneracy and for more than one optimal solution.