8. Consider the graph below and complete the following exercises. 15 marks total) 0 1 2 3 4 5 6 d. Compute the depth-first search tree starting from vertex 0. You must provide your search tree as an adjacency list; do not "draw" your search trees. Whenever you have a "choice" of which adjacent vertex to consider, you must consider the vertices in numerical order from least to greatest. e. Compute the breadth-first search tree starting from vertex 0. You must provide your search tree as an adjacency list; do not "draw" your search trees. Whenever you have a "choice" of which adjacent vertex to consider, you must consider the vertices in numerical order from least to greatest