$9.$ Consider the graph $\backslash ($ G $\backslash )$ on the right.

$($a$)$ Starting at vertex $2,$ draw the depth$-$first$-$search spanning tree for $\backslash ($ G $\backslash ).$ Number the edges in the order that they are visited. $[$Hint: the tree gets quite deep, so you are better off drawing the tree on its side, with the root on the left and the levels increasing to the right$]$

Answer

$($b$)$ Now use the spanning tree you obtained from Part $($a$)$ to find the articulation points and biconnected components in the graph. Use the algorithm presented in class. Show your work.