Find the depth-first search tree for the graph used in Example 7.6 (see Figure 7.28) with G as the starting vertex under the assumption about the adjacency-list order: b. Each adjacency list is in reverse alphabetical order.

Annotate each vertex with the discoverTime/finishTime numbers (see Figure 7.16 on Page 348 for sample numbers), and label each edge as a tree, back, descendant, or cross edge.

Figure 7.28:

Figure 7.16 (For formatting):

Figure 7.28 Digraph from Examples 7.6 and 7.7, used for various exercises