) Design and implement a Graph data structure. Use adjacency matrix to implement the unweighted graph edges. The Graph must support the following operations:
1.Constructor
2.Destructor
3.Copy constructor
4.A function to add an edge between two nodes in the graph
5.A display function that outputs all the edges of the graph
6.A function edge that accepts two nodes, the function returns true if there is an edge between the passed nodes, and returns false otherwise.
B.(100 points) Depth first search and Breadth first search functions.
C.(100 points) A function to output a spanning tree of the graph, use any algorithm you find appropriate, also, make the necessary changes on the data structure in A to implement your algorithm.
