1. Design an DFS-based algorithm A that decides whether a graph G is biconnected. Write pseudo-code for A. Use a recursive procedure to describe A. Instead of just identifying which vertices are already visited, your DFS algorithm should compute the depth of each vertex in the DFS tree. Before a vertex is placed in the tree, its depth is initialized to . Hint: Each vertex v has to learn the depth v.h of the highest vertex in the DFS tree T to which there is an edge from some vertex in the subtree of T rooted at v.

2. Every vertex v knows an increasingly better upper bound on v.h. At which stage of the algorithm does v know the proper value of v.h?