Consider the following DAG $($directed$,$ acyclic graph$)$:

Figure $20\mathrm{.}8.$png

Run the Full$-$DFS algorithm on G$,$ assuming that the for loop in the Full$-$DFS procedure considers vertices in alphabetical order, and that each adjacency list is ordered alphabetically. Then, write down the topological sort ordering of the vertices of G determined by the Full$-$DFS algorithm.