(b) Use the algorithm to solve the following problem

The following is the (forward) dynamic programming algorithm for finding the shortest path from node 1 to node n in a directed acyclic graph.| 1. d(1) == 0,1(1) = + 2. for i = 2, ..., n do 3. forj:(,1) E A do 4. d(t) == min{d(i),d() + 1} Now you want to develop a backward dynamic programming algorithm for the same problem, i.e., an algorithm in which you consider nodes one-by-one starting with n and working backwards. You denote as g(i) the shortest distance from node i to node n. (a) Modify the algorithm above for this case. 5 1 7 2 6 7 1 4 5 9 S 2 N 2 8 4 3 3 The following is the (forward) dynamic programming algorithm for finding the shortest path from node 1 to node n in a directed acyclic graph.| 1. d(1) == 0,1(1) = + 2. for i = 2, ..., n do 3. forj:(,1) E A do 4. d(t) == min{d(i),d() + 1} Now you want to develop a backward dynamic programming algorithm for the same problem, i.e., an algorithm in which you consider nodes one-by-one starting with n and working backwards. You denote as g(i) the shortest distance from node i to node n. (a) Modify the algorithm above for this case. 5 1 7 2 6 7 1 4 5 9 S 2 N 2 8 4 3 3