Question 25 0/2 pts Check all that apply. Consider this pseudocode of Topological Sort. TOPOLOGICAL-SORT(G) 1 call DFS(G) to compute finishing times v.f for each vertex v 2 as each vertex is finished, insert it onto the front of a linked list 3 return the linked list of vertices Can you replace the procedure DFS(G) by another algorithm? If yes, check the algorithms that could replace DFS in the above pseudocode. None of these answers BFS (G,S) (Breadth-First Search) Heapsort(A) Topological Sort Mergesort(A)