How many valid topological sorts does the directed graph G in Figure $2$ below have? List all the

valid topological sorts in the following table. One of them has been listed as an example, where

node A has the last finish time and D has the first.

vertices in order of their discovery time, instead of reverse finish time. $1.$ How many valid topological sorts does the directed graph $\backslash ($ G $\backslash )$ in Figure $2$ below have? List all the valid topological sorts in the following table. One of them has been listed as an example, where node $\backslash ($ A $\backslash )$ has the last finish time and $\backslash ($ D $\backslash )$ has the first.

Figure $2$: Directed $\backslash ($ G $\backslash )$ for topological sort.

Solution: INSERT YOUR SOLUTION HERE

$2.$ Give an example of a graph showing that the topological sort algorithm does not work if we output vertices in order of their discovery time, instead of reverse finish time.

Solution: INSERT YOUR SOLUTION HERE