Q:Question:with the vertices listed alphabetically in each adjacency list.[3 points] Perform Breadth-First Search on the above graph and label the vertices by their distances discovered by Breadth-First Search, starting at the source vertex A.[3 points] Perform Depth-First Search on the graph starting at vertex ????. Draw the resulting Depth-First Search forest and label vertices with the discovery/finishing time and classify and label each edge as treeA:Answer:See a step by step answer