The data below is a dynamic programming solution for a shortest route problem.

-According to Table M2-2, which gives a solution to a shortest route problem solved with dynamic programming, the total distance from City 1 to City 7 is 14.What is the shortest distance from City 3 to City 7?
A)7
B)10
C)13
D)25

Question

The data below is a dynamic programming solution for a shortest route problem.

-According to Table M2-2, which gives a solution to a shortest route problem solved with dynamic programming, the total distance from City 1 to City 7 is 14.What is the shortest distance from City 3 to City 7?
A)7 
B)10 
C)13 
D)25

Quizplus · Accepted Answer

To find the shortest distance from City 3 to City 7, we need to look at the third row of Table M2-2. 
Starting from City 3, we can see that the shortest path to City 7 is through City 5. 
So, the shortest distance from City 3 to City 7 is 10, which is the value in the third row and sixth column of Table M2-2. Therefore, the answer is B.

The Data Below Is a Dynamic Programming Solution for a Shortest