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

Multiple Choice

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