Run Dijkstra's algorithm on the weighted digraph below, starting at vertex A$.$

$($a$)$ List the vertices in the order in which the vertices are dequeued $($for the first time$)$

from the priority queue and give the length of the shortest path from $A.$

$($b$)$ Draw the edges in the shortest path tree with thick lines in the figure above.