Table M2-2
-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
E)None of these

Question

Table M2-2 
-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 
E)None of these

Quizplus · Accepted Answer

Looking at the table, we can see that the shortest distance from City 3 to City 7 is achieved by going from City 3 to City 6 (a distance of 5) and then from City 6 to City 7 (a distance of 5), for a total distance of 10.

Table M2-2 -According to Table M2-2,which Gives a Solution to a Shortest