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$.$

DifNet$2$

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 $5$u in the blank.

When the distance is infinity, write in the ab 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.

$\backslash$table$[[,1$st node,$2$nd node,$3$rd node,$4$th node$],[$u$->,$u$,,,],[$z$,,,,]]$from u to z$.$ Enter only one node

e intermediate node cells. Give the

$t$ cell.breviation 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. right, i$.$e$.$ the node in the left column is chosen first.

$\backslash$table$[[$Step$,$N$^(**),$D$($v$)$p$($v$),$D$($w$)$p$($w$),$D$($x$],[0,$u$,,,],[1,,,,],[2,$w$,,,],[3,$x$,,,],[4,,,,],[5,,,,]]\backslash$table$[[$D$($w$)$p$($w$),$D$($x$)$p$($x$),$D$($y$)$p$($y$),$D$($z$)$p$($z$)],[,,,],[,,,],[,,,],[,,,],[,,,],[,,,]]$