can you solve this using the following algorithm

VAM

$0.$ Given an initial balanced transportation tableau.

$1.$ Compute the di

erence of two smallest entries in every row and column of the tableau and

write this di

erence opposite the row or column. $($If there is only one entry in any row or

column, write that entry.$)$

$2.$ Choose the largest di

erence and use the smallest cost in the corresponding row or column

to empty a warehouse or completely fill a market demand. $($If there is a tie for the largest

di

erence, use the smallest entry in the corresponding rows and$/$or columns. If there is a tie

for the smallest entry, use any such entry.$)$ Circle the cost used and write above the circle

the amount of goods shipped by that route. Reduce the supply and demand in the row and

column containing the cost used.

$3.$ Delete the row or column corresponding to the emptied warehouse or fully supplied market.

If both happen simultaneously, delete the row unless that row is the only row remaining in

which case delete the column.

$4.$ If all tableau entries are deleted, STOP; otherwise go to Step $1.$