AUTO THUMBS UP FOR RESPONSE - JAVA

Consider the DFS algorithm, in the case of an unweighted,undirected graph.

1. What does DFS stand for?
2. Explain the DFS algorithm for that kind of graph.
   Provide a pseudocode description of thealgorithm, sufficiently detailed as to write e.g. Java program codethat implement DFS.
3. Make sure that your DFS algorithm reaches all the nodes in thatkind of graph.