Please teach me how to do this. Thank you. Directed Graphs: DFS and BFS

Perform a depth$-$first search of the above directed graph starting at vertex A$.$ Assume that the Graph.adj $()$ method always returns the adjacent vertices in alphabetical order.

Designate the edges you follow to unmarked vertices with perpendicular tick marks, and in the table below keep track of the vertex from which you reached each vertex $($except $\backslash ($ A $\backslash )).$