Carry out the Dijkstra SSSP algorithm described in lecture and shown in scanned handouts on the weighted directed graph below. Use A as the source vertex and assume adjacency lists are in alphabetical order (A, B, C, D, E, F). 4.0_ 3.0 3.0 5. 0D 7.0 2.0 1. (10 points) Show the priority queue table just before each edge is added, then indicate which edge is chosen from that table to be a tree edge, and continue with the updated table in a new diagram, and the next chosen edge, and so on, until the tree is complete. Be careful to update the intermediate tables correctly. 2. (4 points) How does one use the final table to find the total distance of an arbitrary vertex (B-F) from the source vertex? Illustrate your answer with E. 3. (6 points) How does one use the final table to find the actual shortest path from the source vertex to an arbitrary vertex? Illustrate your answer with D. As a sanity check it is recommended that you inspect the graph to see whether your answers look correct. Carry out the Dijkstra SSSP algorithm described in lecture and shown in scanned handouts on the weighted directed graph below. Use A as the source vertex and assume adjacency lists are in alphabetical order (A, B, C, D, E, F). 4.0_ 3.0 3.0 5. 0D 7.0 2.0 1. (10 points) Show the priority queue table just before each edge is added, then indicate which edge is chosen from that table to be a tree edge, and continue with the updated table in a new diagram, and the next chosen edge, and so on, until the tree is complete. Be careful to update the intermediate tables correctly. 2. (4 points) How does one use the final table to find the total distance of an arbitrary vertex (B-F) from the source vertex? Illustrate your answer with E. 3. (6 points) How does one use the final table to find the actual shortest path from the source vertex to an arbitrary vertex? Illustrate your answer with D. As a sanity check it is recommended that you inspect the graph to see whether your answers look correct