Question: An articulation point in a graph is a vertex whose removal would make the graph disconnected $($broken into two pieces$).$

$$

$($a$)$ Write an efficient boolean method that determines if a graph is connected or disconnected.

$($b$)$ Using the code from part a$.$ Describe an algorithm that would determine all articulation points in a graph.

$($c$)$ What is the order of growth for the code?