If I could get help with this C++ assignment that would be very helpful. Please make sure its in C++ (C plus plus) and NOT in regular C.

Background: Adjacency Matrix: Adjacency Matrix is a 2D array of size Vx V where V is the number of vertices in a graph. Let the 2D array be adj00, a slot adj[i][i] = l indicates that there is an edge from vertex i to vertex j. Adjacency List: An array of linked lists is used. Size of the array is equal to number of vertices. Let the array be array]. An entry array[i] represents the linked list of vertices adjacent to the ith vertex. Following is an example undirected graph with 5 vertices: 4 The adjacency matrix for the above example graph is: 0 01 0 0 1 1 011 1 2 0 00 30 1 01