Given the following undirected graph, 6 2 1 3 5 07 4 7 Write a java code to performs the DFS traversal on the graph to check the connectivity (if the graph is connected) using the following representation: a. Adjacency matrix b. Adjacency list Make sure your program run probably and gives correct results in both cases. Submit the source code and a screenshot of the results in a word document. Note: a DFS traversal makes use of a stack