Hello i want to do this code in c++ datastructure witout any external library all function is inside the only header,imp,main no include of other external library

- integer number of vertices, and the following method members: - constructor: Allocate and initialize the adjacency list. - addEdge: Add an edge between the passed vertices. - deleteEdge: Delete the edge between the passed vertices. - depthFirstSearch: Traverse graph's vertices in depth first search order. - breadthFirstSearch: Traverse graph's vertices in breadth first search order. Note: Test all the Graph functionalities using a menu in your main function, and make sure to separate header and implementation files