Dynamic Programming Consider the following network where the numbers above the arcs are times. We want to determine the fastest route from A to G. Apply the dynamic programming approach to solve this problem (optimal route), by performing the following steps: 1. Write down the number of stages n, the decision variables Xn, the objective function fn (s,xn) and its minimum fn (s) (1 Mark) 2. Construct the tables for n = 3, n = 2, and n = 1. (6 Marks) 3. Based on the tables you constructed write down the fastest route (minimum time) from A to G, and the minimum overall travel time. (2 Marks) 4. Represent the optimal solution graphically on the network. (1 Mark) 6 B B 7 5 8 5 5 2 A E G 7 9 8 5 F