Question: b. (3 points) Using the shortest path that you found in part (a), find the cost of taking such path. c. (2 points) Given the

b. (3 points) Using the shortest path that you found in part (a), find the cost of taking such path.
c. (2 points) Given the arc connecting node 5 and 6 is removed, is your path found in part (a) still optimal?
Problem 5 (15 points) Consider the network flow diagram below for parts (a)-(c). The value on the arc corresponds to the cost (in dollars) to traverse the arc. a. ( 10 points) Find the shortest path from node 1 to node 8 . Show all of your work when solving for the shortest path by showing [dn,vn]=[ cost to get to node n, predecessor node to n ] in each iteration of the algorithm to receive full credit. Please clearly label the sequence of nodes corresponding to the shortest pathStep by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
