Table M2-5
The data below is a dynamic programming solution for a shortest route problem.
-Using the data in Table M2-5,determine the optimal travel path from point 1 to point 7.
A)1 - 2,2 - 4,4 - 5,5 - 7
B)1 - 2,2 - 5,5 - 7
C)1 - 3,3 - 4,4 - 5,5 - 7
D)1 - 2,2 - 4,4 - 6,6 - 7
E)None of the above

Question

Table M2-5
The data below is a dynamic programming solution for a shortest route problem. 
-Using the data in Table M2-5,determine the optimal travel path from point 1 to point 7.
A)1 - 2,2 - 4,4 - 5,5 - 7 
B)1 - 2,2 - 5,5 - 7 
C)1 - 3,3 - 4,4 - 5,5 - 7 
D)1 - 2,2 - 4,4 - 6,6 - 7 
E)None of the above

Quizplus · Accepted Answer

To determine the optimal travel path from point 1 to point 7, we need to follow the cells with the smallest values from the top-left corner (cell 1,1) to the bottom-right corner (cell 7,7) while keeping track of the path. Following this method, we get the path 1 - 2, 2 - 5, 5 - 7, which has a total cost of 15. Therefore, the answer is B.

Table M2-5 the Data Below Is a Dynamic Programming Solution for a for a Shortest