In the given graph, start from node A and search for node F using both depth-first search (DFS) and breadth-first search (BFS). Use alphabetical order to break ties. Show the state of your auxiliary data structures (e.g., stack/queue) at each step. Also, clearly show the order of visiting the vertices.