In the following G, each adjacency list is sorted in increasing alphabetical order. B H G Do depth-first search in G, considering vertices in increasing alphabetical or- der. Show the final result,...

Extracted text: In the following G, each adjacency list is sorted in increasing alphabetical order. B H G Do depth-first search in G, considering vertices in increasing alphabetical or- der. Show the final result, with vertices labeled with their starting and finishing times, and edges labeled with their type (T/B/F/C). Here T, B, F and C refer to tree, back, forward, and cross edges, respectively. For your convenience, the graph is reproduced enlarged below. B D E H G F