(1) Starting at vertex A and resolving ties by the vertex alphabetical order, traverse the (2) Traverse the graph by breadth-first search. Please show the order of enqueuing in (3) Draw a DFS tree and a BFS tree according to the traverse results respectively. (8 pts) graph by depth-first search. Please show the orders pushed onto the stack and popped off the stack respectively. (8 pts) traverse queue. (8 pts)