c++ datastucture

Theory: * Please revise "Graphs" slides. Required Task: Problem Statement A Create class named Graph that contains a dynamically allocated 2D array of integers, integer number of vertices and the following functionalities: constructor: Allocate and initialize the adjacency matrix. addEdge: Add an edge between the passed vertices with the passed weight. delete Edge: Delete the edge between the passed vertices. depthFirstSearch: Traverse the vertices in depth first search order. of Implementation A Start your main program as follows: Create an object of type Graph. Create a menu of Graph functionalities