The Data Below Is a Dynamic Programming Solution for a Shortest

Multiple Choice

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, which cities would be included in the best route?

A) 1, 2, 3, 4, 5, 6
B) 1, 4, 6, 7
C) 1, 2, 5, 6, 7
D) 6, 7