=9-40 In going from Quincy to Old Bainbridge, there are 10 possible roads that George Olin can take. Each road can be considered a branch in the shortest-route problem.

(a) Determine the best way to get from Quincy

(node 1) to Old Bainbridge (node 8) that will minimize total distance traveled. All distances are in hundreds of miles.

Branch Start Node End Node Distance

(in Hundreds of Miles)

Branch 1 1 2 3 Branch 2 1 3 2 Branch 3 2 4 3 Branch 4 3 5 3 Branch 5 4 5 1 Branch 6 4 6 4 Branch 7 5 7 2 Branch 8 6 7 2 Branch 9 6 8 3 Branch 10 7 8 6

(b) George Olin made a mistake in estimating the distances from Quincy to Old Bainbridge. The new distances are in the following table. What impact does this have on the shortest route from Quincy to Old Bainbridge?

Branch Start Node End Node Distance

(in Hundreds of Miles)

Branch 1 1 2 3 Branch 2 1 3 2 Branch Start Node End Node Distance

(in Hundreds of Miles)

Branch 3 2 4 3 Branch 4 3 5 1 Branch 5 4 5 1 Branch 6 4 6 4 Branch 7 5 7 2 Branch 8 6 7 2 Branch 9 6 8 3 Branch 10 7 8 6