A dispatcher for a City’s Taxi Association has five taxi cabs at different locations and four customers who have called for transportation service. The distance (in km) from each taxi’s present location to each customer is shown in the following table.

Cab Customer I II III IV A 7 2 4 10 B 5 1 5 6 C 8 7 6 5 D 2 5 2 4 E 3 3 5 8 a. Determine the optimal assignment that will minimize the total distance travelled. b. Compute the total minimum distance of the optimal assignment. c. If customer III remains to be unavailable due to unexpected case, what will be the revised set of assignment.