How would I properly fill in my Dijkstra algorithm chart to show the shortest path from $t$ to all other nodes?

My Current Table:

$2.$ Shortest path from $t$ to all network nodes.

$\backslash$table$[[$D$($y$),$D$($v$),$D$($u$),$D$($z$),$D$($x$),$D$($w$)],[$Step$,$N$^(\text{'}),$p$($y$),$p$($v$),$p$($u$),$p$($z$),$p$($x$),$p$($w$),,,,,,],[0,$t$,7,$t$,4,$t$,2,$t$,\backslash$oo $,\backslash$oo $,\backslash$oo $,,,,,,],[1,$tu$,7,$t$,4,$t$,,\backslash$oo $,\backslash$oo $,5,$u$,,,,,,],[2,$tuy,$7,$t$,,,\backslash$oo $,8,$v$,5,$u$,,,,,,],[3,$tuvw,$7,$t$,,,\backslash$oo $,8,$v$,,,,,,,],[4,$tuvxy,,,,$19,$y$,,,,,,,,],[5,,,,,,,,,,,,,],[6,,,,,,,,,,,,,]]1-$ Consider the network shown below. Using Dijkstra's algorithm, and showing your work using a table similar to below table $5\mathrm{.}1,$ do the following: a$.$ Compute the shortest path from $\backslash ($ t $\backslash )$ to all network nodes.$|$ b$.$ Compute the shortest path from u to all network nodes. c$.$ Compute the shortest path from v to all network nodes. d$.$ Compute the shortest path from w to all network nodes. e$.$ Compute the shortest path from y to all network nodes. f$.$ Compute the shortest path from z to all network nodes.