2. (5 pt.) [BFS & DFS Tree] Run both BFS and DFS on the graph below, starting from node A. While performing each search, visit the outgoing neighbors of a vertex in alphabetical order. For each search, draw the resulting tree and list vertices in the order in which they were first visited. A B E F [We are expecting: For each of BFS and DFS: a graph on which the algorithm is run, a tree, and a list containing the order of vertices]