1) (50 points] SHORTEST PATH PROBLEM: An express delivery service want to travel the shortest distance to get from node 1 (origin) to node 10 (destination), using the arcs (roads) shown on the figure below. The numbers on the arcs are kilometers. Note that the some arcs only have one-way directions and some has both-way directions. In order to find the shortest path from node 1 to 10: 2 79 73 67 72 70 31 50 17 72 5 25 69 69. 63 87 3 18 8 19 52 10 29 61 56 67 6 15 45 51 69 9 85 a) Use the shortest path (route) algorithm (Dijkstras algorithm) to solve it manually. Prepare a table in EXCEL and show each step of the algorithm in this table (see the example posted in COADSYSEXAM Week06-Transportation Transshipment Shortest Path Problem -SOL.xlsx"). b) Solve the same problem using a minimum cost network flow problem (MCNFP) in EXCEL see the example posted in COADSYSEXAM Week06-Transportation Transshipment Shortest Path Problem -SOL.xlsx). Note that you should get the same answer as in part (a). c) Can you determine ALL the shortest routes from 1 to any node. Please list them in EXCEL with their shortest path and distances traveled. Submit your answer in an EXCEL worksheet named as "Q1(a), Q1(b) and Q1(c) through the Assignment 3 available under Assignments in COADSYSEXAM. Failure of submission will result in a 0 mark for the whole assignment. 1) (50 points] SHORTEST PATH PROBLEM: An express delivery service want to travel the shortest distance to get from node 1 (origin) to node 10 (destination), using the arcs (roads) shown on the figure below. The numbers on the arcs are kilometers. Note that the some arcs only have one-way directions and some has both-way directions. In order to find the shortest path from node 1 to 10: 2 79 73 67 72 70 31 50 17 72 5 25 69 69. 63 87 3 18 8 19 52 10 29 61 56 67 6 15 45 51 69 9 85 a) Use the shortest path (route) algorithm (Dijkstras algorithm) to solve it manually. Prepare a table in EXCEL and show each step of the algorithm in this table (see the example posted in COADSYSEXAM Week06-Transportation Transshipment Shortest Path Problem -SOL.xlsx"). b) Solve the same problem using a minimum cost network flow problem (MCNFP) in EXCEL see the example posted in COADSYSEXAM Week06-Transportation Transshipment Shortest Path Problem -SOL.xlsx). Note that you should get the same answer as in part (a). c) Can you determine ALL the shortest routes from 1 to any node. Please list them in EXCEL with their shortest path and distances traveled. Submit your answer in an EXCEL worksheet named as "Q1(a), Q1(b) and Q1(c) through the Assignment 3 available under Assignments in COADSYSEXAM. Failure of submission will result in a 0 mark for the whole assignment