For the following digraph, apply Dijkstra's Algorithm to find the shortest path (i.c., with the minimum weight) from A to E. Show the initial value in the priority queue and the values in the priority queue after each pop() operation and subsequent updating of all neighbors. Use the format (VertexID, Dist, Parent) (Example, (B, 6, A)) for each priority queue entry. Start: pop(): PQ: PQ: 2 Figure 2: B E for Dijkstra.