Consider the following graph. 2 3 4 a) Apply the depth-first search algorithm with ties broken on alphabet- ical order. At each stage show the status of the stack, and indicate the edges used to build the depth-first search tree. b) On the same graph as in part a) run the breadth-first search, again showing the status of the queue at each iteration, along with the edges of the breadth-first search tree.