2. Starting at v2 (top-right vertex) for the graph below, list the vertex order for. (a) depth-first search, and (b) breadth-first search. Each answer will be a list starting with v4. Select neighbors in increasing index order, as demonstrated in class. Ignore edge weights. You may use your program from the previous problem to check your work, but you will be expected to produce results by hand during an exam. 2 start Show transcribed image text
OR
OR