Apply the DFS-based algorithm to solve the topological sorting problem for the following digraphs: Hints: intermediate steps are not required. You only need to list the topological order obtained by using the DFS-based algorithm (a.k.a the order all vertices are popped off from the stack in a DFS). Also, if a topological order cannot be obtained, explain the reason and indicate when the DFS-based algorithm stops