Below is a table of times for Taxis (A to H) to reach Customers (1 to 8) who need a ride home after a night on the town. The goal is to Minimize the time it takes for all of the Taxis to reach their Customers. Only one Taxi will be sent to each Customer and each Customer needs only one Taxi. Taxi / 1 2 3 10 5 6 7 8 Cust A 4 7 13 14 12 18 15 13 B 15 18 5 11 8 17 13 15 C 13 16 7 16 3 8 12 7 D 14 12 12 8 9 3 8 16 E 13 5 16 9 11 18 15 15 F 8 11 2 9 14 17 15 15 G 5 14 13 15 17 16 19 7 H 2 3 9 10 14 11 5 16 The optimal solution to this problem requires the following: A A/ Taxi A picks up Customer Taxi B picks up Customer The optimal solution to this problem requires the following: Taxi A picks up Customer Taxi B picks up Customer Taxi C picks up Customer Taxi D picks up Customer Taxi E picks up Customer Taxi F picks up Customer Taxi G picks up Customer Taxi H picks up Customer A W A N AJ W A A/ Minimum Cost = be between 35 and 43 Enter your cost without any Formatting.... No Dollar Signs and No Commas A Hint: Your cost should