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. A. Show how the algorithm works by computing the table shown below. Note on answer format: Fill in the N* set with selected nodes without space. For example, if the node set contains nodes, x, y, and z, enter xyz in the blank. Fill in the D(.)p(.) cell without space, for example, for D(.)=5 and p(.)=u, fill in 5u in the blank. When the distance is infinity, write in the abbreviation inf in the blank. When there is a tie in node distances, please choose from left to right, i.e. the node in the left column is chosen first. Step N* D(v)p(v) D(w)p(w) D(x)p(x) D(y)p(y) D(z)p(z) 0 [Fill in the blank] [Fill in the blank] [Fill in the blank] [Fill in the blank] [Fill in the blank] [Fill in the blank] 1 [Fill in the blank]   [Fill in the blank] [Fill in the blank] [Fill in the blank] [Fill in the blank] 2 [Fill in the blank]     [Fill in the blank] [Fill in the blank] [Fill in the blank] 3 [Fill in the blank]       [Fill in the blank] [Fill in the blank] 4 [Fill in the blank]         [Fill in the blank] 5 [Fill in the blank]           B. 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 [Fill in the blank] [Fill in the blank] [Fill in the blank] z [Fill in the blank] Multiple fill-in-the-blank