b. (10 points) Starting at vertex a and resolving ties by the vertex alphabetical order, traverse the graph by DFS (depth-first-search) and construct the corresponding DFS tree. Give the order in which the vertices were reached for the first time (pushed onto the traversal stack) and the order in which the vertices became dead ends (popped off the stack). 9 e