Consider the graph provided where the edges represent the cost of travel between nodes. Apply Dijkstra's algorithm to compute the shortest path from node $\text{'}$u$\text{'}$ to all other nodes in the network.

You have been provided with a table that represents the steps in Dijkstra's algorithm.

Steps $0$ and $1$ have been filled in as a reference for you.

Please follow the below instructions to fill the table:

$-$ Use lowercase letters for node identifiers with no spaces$-$write 'uwv', not 'UWV' or $\text{'}$u w v$\text{'}.$

$-$ When specifying a predecessor and cost, do not include spaces before or after the comma$-$write $\text{'}\backslash (3,\backslash$mathbf$\{$u$\}\backslash )\text{'},$ not $\text{'}3,$ u$\text{'}.$

$-$ If a value is infinite or undefined, write 'inf' with no spaces around it$.$

$-$ Entries are case$-$sensitive; use lowercase only; no spaces.

$-$ Ensure accuracy and consistency throughout the table, following the format of the provided steps $0$ and $1.$