Q:Question:Answer step 1 and step 2 3. Directed graph: shortest paths using topological sort algorithm (15 pts) Using the topological sort algorithm, find the shortest paths from node A to all other nodes in the following directed acyclic graph. Please show the procedures and result for each of the steps below. - Step 1: Find a topological sort order; - Step 2: Follow the topological sort order in Step 1 and perform edge relaxation.A:Answer:Topological Sort is a linear ordering of the verti...