Need the answer in C++, Thanks!

Part 1: Implement a Graph class using the adjacency matrix to represent a graph. Test your class. Part 2: Implement a Graph class using the adjacency list to represent a graph. Test your class.

Part 3: 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.