$(12$ points$)$ Suppose that you are running Dijkstra's algorithm on the edge$-$weighted

digraph $($Table A$,$ below left$),$ starting from a source vertex s$.$ Table B gives the edgeTo$[]$

and dist To$[]$ values immediately after vertex $2$ has been deleted from the priority queue and

relaxed.

Table A

Table B

a$)$ Give the order in which the first $5$ vertices were deleted from the priority queue and

relaxed.

b$)$ Modify Table B above to show the values of the edgeTo$[]$ and distTo$[]$ arrays

immediately after the next vertex has been deleted from the priority queue and relaxed.

Circle those values that changed.