See below for the adjacency lists, with vertices listed in alphabetical order: A B, C, D, F B C, E C E, F, G D-F E G F GH H graph and label the a. [3 points] Perform Breadth-First Search on the vertices by their distances discovered by Breadth-First Search, starting at the source vertex A. [3 points] Please perform Depth-First Search starting at the vertex A. Draw the resulting Depth-First Search forest and label vertices with the discovery/finishing time and classify and label each edge as tree (T), back (B), cross (C) or forward (F) edge as the case may be. [2 points] Does your search show that the graph is acyclic? If it is, please find the topological sort sequence of vertices, assuming that during the Depth-First Search if there are multiple vertices that can be discovered next, we discover vertices based on their alphabetical order. A D B F E) G H)