(Solved): 8. To get the topological sort of a directed graph with multiple "in-degree zero" nodes we must: A) ...

8. To get the topological sort of a directed graph with multiple "in-degree zero" nodes we must: A) Perform a DFS on all nodes ommiting the ones you've already visited and then merge the reversed results B) Do nothing, a topological sort cannot be performed on graphs with multiple in- degree zero nodes. C) Perform a DFS starting at any in-degree zero node and then reverse the result D) Perform a pre-order sort on the left most node with in-degree zero, skipping other in-degree zero nodes until the end.