# Question 2 options: 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 Tahttps://d2vlcm61l7u1fs.cloudfront.net/media%2F333%2F3334cdba-ca47-4af8-8de2-11c4bb31988d%2FphpNz3zZS.pngxi will be sent to each Customer and each Customer needs only one Taxi. The optimal solution to this problem requires the following: Taxi A picks up Customer Spell check Taxi B picks up Customer Spell check Taxi C picks up Customer Spell check Taxi D picks up Customer Spell check Taxi E picks up Customer Spell check Taxi F picks up Customer Spell check Taxi G picks up Customer Spell check Taxi H picks up Customer Spell check Minimum Cost = Spell check Hint: Your cost should be between 37 and 42 Enter your cost without any Formatting…. No Dollar Signs and No Commas

Question 2 options:

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 Tahttps://d2vlcm61l7u1fs.cloudfront.net/media%2F333%2F3334cdba-ca47-4af8-8de2-11c4bb31988d%2FphpNz3zZS.pngxi will be sent to each Customer and each Customer needs only one Taxi.
The optimal solution to this problem requires the following:

Taxi A picks up Customer Spell check

Taxi B picks

AllEscortAllEscort