3. We are running depth-first search on the graph below and assuming that the searches visit the neighbors of a node and the sources in numerical order (smaller first) a. Draw the breadth-first search tree starting from vertex 1