1. Tracing Basic Graph Algorithms 12 5 10 -No 3 11 8 E 12 G ply Depth-First Traversal (DFT) on the above DAG. Show on the graph the discovery and finish times fom ode. Follow the alphabetical order if there are ties. /5) at is the Topological Order of the vertices in the above DAG? Assuming that the DFT-based algorithm used and that an alphabetical order has been followed during the DFT traversal. [/5 4th Vertex 2nd Vertex 5th Vertex 6th Vertex 7th Ver 3d Vertex ex that we apply Dijkstra's algorithm to find the shortest path from A to all the other vertices in hat order will the vertices be de-queued from the priority queue? 5th Vertex 6th Vertex 4th Vertex 2nd Vertex 3rd Vertex 7th