Q$3)$ Consider the following undirected, weighted graph:

$(20$p$)$Step through Dijkstra's algorithm $($discussed in lecture$)$ to calculate the single$-$source shortest paths from S

to every other vertex. Show your steps in the table. As the algorithm proceeds, cross out old values and write in

new ones, from left to right in each cell. If two unvisited vertices have the same distance, use alphabetical order

to determine which one is selected first.