Please use the table $($that we used in class$)$ to show the key steps of the Depth$-$First Traversal on the following directed graph starting from vertex A$.($Note: follow alphabetical order when processing neighbors.$)$

Please also show the resulting Depth$-$First Traversal Tree. Please use tables as example for answer

$\backslash$table$[[$frontVertex$,$nextNeighbor,Visited vertex,$\backslash$table$[[$vertexQueue$],[($front to back$)]],\backslash$table$[[$traversa$10$rder$],[($front to back$)]]],[,,$A$,A,$A$],[$A$,,,$empty,$],[$B$,$B$,$B$,AB$

Please use the table $($that we used in class$)$ to show the key steps of the Depth$-$First Traversal on the following directed graph starting from vertex A$.($Note: follow alphabetical order when processing neighbors.$)$

Please also show the resulting Depth$-$First Traversal Tree.