$*$run without code show diagram$*$

Run Dijkstra on the following graph to find the shortest path from source node $S_{?}$ to all the other

nodes. Show the graph after each step, similar to the example in the lecture. The distance of each

node from the distance has been initialized with infinity. $(2$ points$)$