There Are Six Cities (City 1-City 6)serviced by a Particular

Multiple Choice

There are six cities (City 1-City 6) serviced by a particular bus line.Limited routes are available,and the distance for each of these routes is presented in the table below.
-If dynamic programming were used to solve for the minimum distance from City 1 to City 6 above,how many stages would there be?

A) 6
B) 5
C) 4
D) 3
E) 2