A food delivery service relies on a team of drivers to deliver hot meals to customers in a neighbourhood. Unfortunately, the driver dispatching service has malfunctioned, and you have been asked to dispatch the drivers manually. At one point in time, five customers have placed orders with 5 different restaurants, as per the table below: Customer Customer A Customer B Customer C Customer D Customer E Restaurant Restaurant C Restaurant E Restaurant D Restaurant B Restaurant A Travel time 7 minutes 10 minutes 4 minutes 5 minutes 14 minutes c. Five drivers happen to be available when the orders were placed. Use the Hungarian algorithm to dispatch them (ie. determine which driver will serve each customer) and estimate how long it will take to complete each order. Assume that the orders are placed simultaneously, and the drivers are ready to depart 5 minutes after arriving to the restaurant. A travel time matrix (in minutes) between the initial location of the drivers and the restaurants is as follows: E Drivers Restaurants B D 2 10 9 4 B 12 6 12 10 C20 8 15 5 D 10 4 8 10 E 7 12 5 8 15 8 16 8 12 [10 marks]