Suppose that G is a directed acyclic graph and that T is a topological ordering of G. Describe how to use T to choose an ordering for the outer loop (for each vertex v in G) of the DFS-based topological ordering algorithm, so that the output of the algorithm will be the same ordering, T.