You have been tasked with sending a particular toy from a set of suppliers to a set

of demand points. You plan on applying the greedy heuristic for the transportation probem.

The supply levels of the suppliers are:

Supplier LA Denver Chicago Atlanta

Supply $2500125020001750$

The demand levels of the demand points are:

Supplier SF Salt Lake City Austin Orlando Philadelphia Detroit

Demand $1000125075015007501250$

Note that the total supply is greater than the total demand in the system. The per$-$unit shipping costs are given in the table below:

$1$

$($a$)[25$ points$]$ Apply the greedy heuristic for this problem. For full credit, at each step,

you must show which pair has the lowest remaining cost, their current supply and demand

levels, and the amount that you will ship between them. You should run the heuristic until

all demand is satisfied $($b$)[5$ points$]$ Your company is considering reducing the supply level

of one of the four suppliers by $500$ units. Provide your recommendation to which facility

should have its supply decrease and the logic behind your choice.