Run the Dijkstra's algorithm on the following graph to find short distance from $1$ to all the other vertices.

At first using general steps, annotate the shortest distance to all the nodes directly on the graph.

Then show the steps by updating the following table with the status of the minheap, distance $($D$),$ and

completed status $($S$)$ at each step.