Using Dijkstra's algorithm, find the least cost path from source node $u$ to all other destinations. Show your work in tabular format, as in Table $5\mathrm{.}1$ in the text.

$\backslash$table$[[$step$,N^{\text{'}},D(v),p(v),D(w),p(w),D(x),p(x),D(y),p(y),],[0,,,,,,],[1,,,,,,],[2,,,,,,],[3,,,,,,],[5,,,,,,]]$

Also, complete the forwarding table for node u$,$ based on your work above.

$\backslash$table$[[$Destination$,$Next$-$hop router$],[$v$,],[$w$,],[x,],[y,],[z,]]$

Feel free to complete your work in whatever paper$-$ or digital$-$based tool you'd like. Upload a screenshot or photo$/$scan of your work here.