A traveling salesman intends to sell his wares in 5 cities: Atlanta, Boston, Chicago, Detroit, and Eugene. There are many different orders in which he could visit them (ABCDE, AEBCD, DEBAC, etc.) He wants to know which order will minimize the distancehe must travel, so he gets out his atlas and figures out the distance involved in each path. He’ll pick the shortest path and use that one. Ifit takes him 1 minute to compute the length of each path, how long will it take him to find the shortest path?