Problem 3. A directed graph has node set N = {1,..., 10} and the arc set given in the table on the next page. Determine the shortest path from node 1 to node 10 using dynamic programming. Arc 1 2 3 From 1 1 1 To 2 4 6 Cost 4 7 8 o 4 6 7 12 6 woo vaaAANO AN -- 5 11 12 16 15 11 12 13 9 14 15 16 17 18. 9 3 5 7 9 7 10 10 10 10 16 8 4 14 19 For all problems, you can use any software to code the dynamic programming equation and solve. However, you cannot use an optimization solver to solve the problems. Please, provide printouts. Problem 3. A directed graph has node set N = {1,..., 10} and the arc set given in the table on the next page. Determine the shortest path from node 1 to node 10 using dynamic programming. Arc 1 2 3 From 1 1 1 To 2 4 6 Cost 4 7 8 o 4 6 7 12 6 woo vaaAANO AN -- 5 11 12 16 15 11 12 13 9 14 15 16 17 18. 9 3 5 7 9 7 10 10 10 10 16 8 4 14 19 For all problems, you can use any software to code the dynamic programming equation and solve. However, you cannot use an optimization solver to solve the problems. Please, provide printouts