Use Dijkstra's algorithm to find the shortest path from node A to node F in the following network and give its length.

In the table of distances below, list all steps of the algorithm. In the columns for each node A $...$ F list the values $($length of the path from A$)$ for each node at every step $($row$)$ of the algorithm in this form, e$.$g$."10$B$"($meaning that at this node the path has length $10$ through node B$).$ Include initialisation step.

$-$ For infinite $($unknown$)$ length, enter "inf.

$-$ To denote that a node was visited at step N $,$ put $"$V$"$ in its cell for that step N $.$

$-$ After the node was visited in step N $,$ you need to put $"-"$ in the all the next rows $\backslash (>\backslash$mathrm$\{$N$\}\backslash )$ for this node.

The shortest path from A to F is $($enter nodes from A to F$,$ separated by comma $",")$

The length of the shortest path from $\backslash ($ A $\backslash )$ to $\backslash ($ F $\backslash )$ is