For questions 67: Consider the following digraph. Assume the adjacency lists are ibe for example, when iterating through the edges pointing from o, consider the ed ge sorted order: 2 or 6. Run denth first search on the digraph, starting from vertex 0 and list the vertices as leaed the class. (10 points) Run breadth first search on the digraph, starting from vertex 0 and list the vertices as learned in the class. (10 points) 7