Given the graph class using the adjacency matrix representation, Implement the DFS algorithm on graph using the adjacency matrix representation. You have to use the graph code as a starting point, and...

Given the graph class using the adjacency matrix representation, Implement the DFS algorithm on graph using the adjacency matrix representation. You have to use the graph code as a starting point, and add the DFS method in the graph

class similar to the BFS method already present in the Graph class.

Should be coded in C++