Consider the following network. With the indicated link cost, use Dijkstra's shortest part algorithm to compute the shortest path from node u to node z

d Question 5 077 pts Consider the following network. With the indicated link costs, use Dijkstra's shortest-path algorithm to compute the shortest path from node u to node z 5 Cu 2 . Z -W- 2 -Sy 1. What is the shortest distance to node w and what node is its predecessor? Write your answer as np 2. What is the shortest distance to nodex and what node is its predecessor? Write your answer as np 3. What is the shortest distance to node y and what node is its predecessor? Write your answer as np 4. Enumerate the shortest paths from u to z. Enter only one node name, v, w, x, or y, into each of the intermediate node cells. Give the total path cost of u to z in the last cell. 1st node 2nd node 3rd node 4th node last node Total path cost u Z u