Use Dijkstra's algorithm to find the shortest path from $u$ to $w$ for the following graph.

$($i$)$

The table below is similar to Table $10\mathrm{.}6\mathrm{.}1.$ Fill in the missing entries to show the action of the algorithm.

$\backslash$table$[[$Step$,v(T),E(T),F,L(t),,L(u),L(v),L(w),L(x),L(y),L(z)$