use step count method to find the time complexity of

1- Depth-first search algorithm

2- Breadth-first search algorithm?

Depth-first search algorithm 1. 2. Start at vertex u. Mark it visited (color gray) and set its discovery time For each vertex v adjacent to u 1. If v has not been visited 1. Insert u, v into DFS tree 2. Recursively apply this algorithm starting at v Mark u finished (color it black) and set its finish time 3. 1. 2. Take a start vertex, mark it identified (color it gray), and place it into a queue. While the queue is not empty 1. Take a vertex, u, out of the queue (Begin visiting u) 2. For all vertices v, adjacent to u, 1. If v has not been identified or visited 1. Mark it identified (color it gray) 2. Place it into the queue 3. Add edge u, v to the Breadth First Search Tree 3. We are now done visiting u (color it black)