1. The convention is to break ties by processing vertices in numerically ascending order. 2. Only indicate tree edges in your answer. Non-tree edges may be indicated, but it is optional. Individual exercise 2* Consider the following graph: 1. Perform a depth-first search (DFS) traversal on the graph. Use vertex 0 as the root node. 2. Perform a depth-first search (DFS) traversal on the graph. Use vertex 7 as the root node.