Consider the adjacency-lists representation of a DAG with 8 vertices and 13 edges:

 A: B: C F A G C: H G D D: E: A F: A E G G: H H: D 

Here is a graphical representation of the same DAG:

 (A)<------------(B)------------>(C)------------>(D) ^^ |\ |\ ^ | \ | \ | \ | | \ | \ | \ | | \ | \ | \ | | \ | \ | \ | | \ | \ | \ | | \ | \ | \ | | \ | \ | \ | | \ | \ | \ | | \ | \ | \ | | \ | \ | \ | | \ | \ | \ | | \ | \ | \ | | \ | \ | \ | | \v vv v| (E)<------------(F)------------>(G)------------>(H) 

Give the topological order of the vertices that results from the DFS-based topological sort algorithm. As usual, perform the first DFS from vertex A.

Enter your answer as a sequence of capital letters, separated by spaces. (Hint: A is last.)