(a). List the vertices in graph A in the reverse order of their visit (finish) time for a depth-first search that starts at vertex A. Repeat the process, and produce a different list by assuming that the scan accesses neighbors in a different order.
(b). List the vertices in graph B in the reverse order of their visit (finish) time from a depth-first search starting at vertex C and first accessing neighbor D.
(c). For both graph A and graph B, identify the starting vertices that would produce a breadth-first scan that visits all of the nodes in the graph.
(d). In graph B, list a possible order of visits to vertices in a breadth-first scan that begins at vertex C.
(e). List the elements in dfsList that result from a full depth-first scan (dfs()) of graph A. Assume that the first scan (dfsvisit()) begins at vertex B and that upon completing those recursive calls that dfsVisit() resumes at vertex A.