Algorithims

2. Now implement the functions explore and DFS that perform a depth-first search of a given graph. Building on these functions, write a new function that solves the CONNECTEDCOM- PONENTS problem. Recall that the output of the CONNECTEDCOMPONENTS problem is a labeling of the vertices of the graph so that all vertices in the same connected component get the same label and vertices in different connected components get different labels Now use your code to answer the following questions: (a) What is the size (i.e., number of vertices) of a largest connected component in the word graph? (b) What is the number of connected components in the word graph? (c) What is the number of size-2 connected components in the word graph