Consider the network given below. With the indicated link costs, use Dijkstra$$s shortest$-$ path algorithm to compute the shortest path from z to all network nodes.

a$.$ Show how the algorithm works by computing a table similar to the following table.

Step N$\text{'}$ D$($x$),$ p$($x$)$ D$($u$),$ p$($u$)$ D$($v$),$ p$($v$)$ D$($w$),$ p$($w$)$ D$($y$),$ p$($y$)$ D$($t$),$ p$($t$)$

$0$ z $7,$ z $\backslash$infty $\backslash$infty $\backslash$infty $11,$ z $\backslash$infty

b$.$ Show the resulting forwarding table in z $($e$.$g$.,$ to x via link $($z$,$x$)).$

Note: For online exam, you may only give the final answer during the exam. Then after finishing the online exam, upload your calculation procedure $($scanned copy or clear picture$)$ to the corresponding exam portal on the Blackboard website, so that if the final answer is not correct, you may still get some partial points from the calculation procedure.