TO
     A  B  C  D  E  F  G  H  
   A 0  0  0  0  0  0  0  0  
   B 1  0  0  0  0  0  0  0  
F  C 1  0  0  0  1  0  1  0  
R  D 1  1  1  0  1  0  0  0  
O  E 0  0  0  0  0  0  0  0  
M  F 1  1  0  0  1  0  1  1  
   G 1  1  0  0  1  0  0  0  
   H 1  1  1  0  1  0  1  0  

Perform a DFS search on this graph; draw
the DFS search tree associated with the search. 
Then show the result of the DFS-based topological
sorting algorithm.