Please show work and explain

1.

Choices are: 3, None of these, 2, 4, 1

Answer for the letters below:

A. B. C. D.

2.

3.

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