This needs to be done in C++ and split into three projects for each exercise. The exercises can be used for one another and should be. Also preferably compiled in Visual Studio.

Exercise 1: Adjacency Matrix Implement a Graph class using the adjacency matrix to represent a graph. Test your class.

Exercise 2: Adjacency List Implement a Graph class using the adjacency list to represent a graph. Test your class.

Exercise 3: Graph Traversal Add a method to both of the Graph classes developed in the previous exercises to print the graph nodes using a depth-first search traversal. Test the methods.