Q$1(10$ points$)-$ Graph Traversal: DFS

A directed graph $\backslash ($ G $\backslash )$ is shown below. Assume that the adjacency lists are in alphabetical order. Apply depth$-$first search $($DFS$)$ on the graph, starting from vertex A$.$ The DFS should proceed alphabetically for undiscovered vertices.

Tasks:

$-$ Enter the discovery times of the selected vertices.

$-$ Enter the finish times of the selected vertices.

$-$ Enter the predecessor of each selected vertex.