- Choose the correct answer ( u can choose more than one answer)

Mr and Mrs. K are planning on a field trip from city 1 to city 10, they wish to reach city 10 in the shortest distance, they would like to stop a cities in between to rest for few hours. The following figure shows the network of cities, there are two tables that show the distance between cities, for example .from table 1, we can see the distance between city 7 and 2 is equal to 50 10 d 2 3 4 d 6 7 10 8 23 28 15 48 38 22 1 6 7 75 75 50 85 150 65 150 25 15 125 65 85 Model the question as a Dynamic Program, SELECT ALL CORRECT STATEMENTS FROM THE FOLLOWING F2(2) would be equal to 93 A The problem has 4 stages in Dynamic Programming model 6 F3(6) would be equal to 38 The optimal route would be 1-2-7-8-10 D We should start the solution from City 10 (i.e. Backwards) When evaluating F1(1) we would select the shortest distance among 4 options The shortest distance would be equal to 196 G F3(2) would be equal to 111 F3(7) would be equal to 60