Trace the execution of Dijkstra's algorithm to find the shortest paths from vertex 0 to all other vertices in the following graph. You need to update the table below for each step involved in Dijkstra's algorithm. Show also the content of 5, the vertices for which we have computed the shortest distance so far, V-S, the remaining vertices that we still need to process.
5
12
Initial table:
Vertex Distance Path
1 3 10
2 8 3
3 0 3
4 8 5
5 0 5
6 8 7
8 0 0
9 0 0
10 11 0
12