I need help with this quick

1. Shortest paths. (8 points Run Dijikstra's algorithm on the weighted digraph below, starting at vertex A 14 13 12 36 16 30 15 10 (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