Write a java Program for

Depth-first search (DFS) in JAVA is a classic method for systematically examining each of the vertices and edges in a graph. The aim of DFS algorithm is to traverse by going through the depth of the graph from the starting node. 1. Given a graph, create a function called List dfs(Graph G) that performs the deep first search (DFS) algorithm for visiting the graph G. This function must return the list of vertices in the order of their first encounter. In case of choice, the vertex with the smallest identifier will be chosen. 2. One important application of the depth first search algorithm is to find the connected components of a graph. Write a function int cc(Graph G) that takes as input a simple graph and determines the number of connected components. The function int cc(Graph G) must use the DFS algorithm. Write a function called isConnected() that returns true if the graph is connected, false otherwise. 3. Test the dfs(.) and cc(.) functions with the graph is the graph-DFS-BFS.txt file. Consider as starting node the node 5. What is the order of the first encounter of the nodes? How many components does the graph have? Is it connected?