=9-38 The German towns around the Black Forest are represented by nodes in the network below. The distances between towns is shown in kilometers. Find the shortest route from city 1 to city 16. If flooding in cities 7 and 8 force closure of all roads leading into or coming out of those cities, how would that impact the shortest route?

Network for Problem 9-38