Question 3. (30 points): The data given in the following table are distances of arcs between pairs of nodes i and j in a network, where i, j = 1,...,11. An empty cell indicates that there is no arc between that pair. To 6 7 From 1 5 8 9 10 11 2 5 3 2 4 4 3 4 8 O NOU-WN 129 9 11 10 10 (a) Plot a graph (or a network) to illustrate this problem. (b) Formulate an MCNFP, whose solution can be used to find the shortest path from node 1 to node 11. (c) Code this MCNFP in GAMS/Excel/Matlab. Do not submit the code in Sakai, but run your code and interpret your result in detail. (d) Assume that for each route on arc (i, j), we need to pay a cost c(x) = Vx, where x is the length of this arc (the distance between node i and node j). Reformulate this problem as an MCNFP, and code it in GAMS/Excel/Matlab. Do not submit the code in Sakai, but run your code and interpret your result in detail. Compare this result with the one in Question (b). Question 3. (30 points): The data given in the following table are distances of arcs between pairs of nodes i and j in a network, where i, j = 1,...,11. An empty cell indicates that there is no arc between that pair. To 6 7 From 1 5 8 9 10 11 2 5 3 2 4 4 3 4 8 O NOU-WN 129 9 11 10 10 (a) Plot a graph (or a network) to illustrate this problem. (b) Formulate an MCNFP, whose solution can be used to find the shortest path from node 1 to node 11. (c) Code this MCNFP in GAMS/Excel/Matlab. Do not submit the code in Sakai, but run your code and interpret your result in detail. (d) Assume that for each route on arc (i, j), we need to pay a cost c(x) = Vx, where x is the length of this arc (the distance between node i and node j). Reformulate this problem as an MCNFP, and code it in GAMS/Excel/Matlab. Do not submit the code in Sakai, but run your code and interpret your result in detail. Compare this result with the one in Question (b)