For each vertex, show the order in which the vertex is encountered by the DFS and BFS algorithms. Assume that when checking neighbors of a vertex, the neighbors are looked at in alphabetic order. How many times do each of the algorithms check whether a vertex is marked with a zero (include both successful and successful checks)? How does this compare to the total number of vertices?

5. Consider the graph shown below