Exercise 4 (Topological Sort with pre numbers) To topologically sort a graph G, we run DFS and then sort the vertices in reverse order of their post numbers. Suppose we use the pre numbers instead. Give a counterexample showing that this does not always produce a topological sort