Acyclic Graphs and Topological Order Homework 2.01 Consider the graph shown at the right. Carry out the topological-order algorithm mentioned in lecture and given in the text as Alg. 7.5, p. 353. You may build a vertical stack alongside the picture instead of keeping track of numbers in an array topo. What reverse topological order is found if vertices are traversed in alphabetical order and adjacency lists are in alphabetical order (A, B, C, D, E, F, G, H)? If you show a stack, be sure to indicate where are the top and bottom