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. The optimal solution to this problem requires the following: Taxi A pieks up Customer A Taxi B picks up Customer A Taxi C picks up Customer A Taxi D picks up Customer A Taxi E picks up Customer A Taxi F picks up Customer A Taxi G picks up Customer A Taxi H picks up Customer A Minimum Cost = A Hint: Your cost should 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. The optimal solution to this problem requires the following: Taxi A pieks up Customer A Taxi B picks up Customer A Taxi C picks up Customer A Taxi D picks up Customer A Taxi E picks up Customer A Taxi F picks up Customer A Taxi G picks up Customer A Taxi H picks up Customer A Minimum Cost = A Hint: Your cost should