Given the graph G = (V, E) in the figure below, compute: the BFS tree; the DFS tree. To do so, start with vertex 4 for both trees. For BFS, if a vertex has several adjacent vertices, then process the vertices in sorted order from smallest to largest index. For example, vertex 1 has four adjacent vertices: 4, 6, 7, and 9. Process vertex 4 first, then 6, 7, and finally 9. Similarly, for DFS, if a vertex has several possible options, select the one with the smallest index. To output the tree, you may draw it or provide the adjacency list of the tree where the vertices in each list are sorted from smallest to largest.