Please explain and show work

1.

2.

Assume that you are going to conduct BFS (= Breadth-First Search) for the following graph from the vertex d. Select the correct BFS tree of the BFS traversal. (3) (4) (3) (4) (1) None of these. (2) Assume that you are going to conduct DFS (= Depth-First Search) for the following graph from the vertex a. Fill the mark array for the vertices c,d,e, and f as you learned in the lecture. When you traverse the graph, you should follow our convention (= alphabetical order of vertex characters)