Problem : Articulation Point Let G(V, E) be an undirected graph given in adjacency list representation. Say thet v V is an articulation point if and only if, removing v from V and also removing all edges incident to v from E increases the number of connected components of G. (a) Give an example graph G(V,E) that has two connected components and no articulation point. (b) Give an example graph G(V,E) that has two connected components and three articulation points. (c) Give an O(|V | + |E|) running time algorithm that on input an undirected graph G(V, E) and a vertex v V, the algorithm returns YES/NO if V is an articulation point.