Study the below graph, and answer the following questions: 1- What is the corresponding adjacency matrix 2- Show order of nodes if a Depth-First-Search is invoked on node 1 Show order of visiting nodes, if a Breadth-First-Search is invoked at node 1 3- 1 2 5 3 4 6 7 8 9 10

Consider the following graph. Start from vertex x, use the Depth First Search (DFS) algorithm (described in the textbook) to compute the DFS tree(s). Show intermediate results similar to the textbook example and show the final DFS tree(s). It is assumed that in the adjacency list representation, all vertices are stored according to their alphabetical order. In other words, a vertex’s neighbors should be explored by their relative alphabetical order.

3. List the order in which the vertices are visited with a breadth-first search starting with vertex 1. If there are multiple vertices adjacent to a given vertex, visit the adjacent vertex with the lowest value first. 1 8 2 4 6 3 7 9 10

QUESTION 56 What data structure is used for depth first traversal of a graph? O A. list O B. none of these answers OC. queue O D. stack Click Save and Submit to save and submit. Click Save All Answers to save all answers. 8922090