• 
  

5. [10 points] Consider the following graph: 2 5 3 6 a) Starting at vertex 1 and resolving ties by vertex d number, traverse the graph by depth- first search and construct the corresponding depth-first search tree. b) Starting at vertex 1 and resolving ties by vertex id number, traverse the graph by breath- first search and construct the corresponding breath-first search tree.