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 distance of stage 1.

A) 0
B) 8
C) 7
D) 14
E) None of the above