(Solved): Help with all parts plz :) b. [3 points] Perform Breadth-First Search on the above graph and label ...

b. [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 $\mathbf{A}$. . [3 points] Perform Depth-First Search on the graph starting at vertex $\mathbf{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. Assume that during the search if there are multiple vertices that can be discovered next, visit vertices based on their alphabetical order (as listed in the adjacency list). d. [1 point] Explain how Depth-First Search shows that the graph has at least one cycle.