Please help with C++ graph question in C++ language. Thank you.
![1. Write a program that implements an adjacency matrix for an undirected and unweighted<br>graph.<br>struct Edge<br>{ int vertexl;<br>Int vertex2;<br>} ;<br>Implement the following functions.<br>a. void insertEdge (Edge e, int adjMat[4] [4]);<br>a. //Purpose: Store an edge defined by two vertices.<br>b. void printGraph (int adjMat[4] [4])<br>a. //prints the edges included in an adjacency matrix<br>c. Test your program output with graph G that has 4 vertices (1, 2, 3, and 4) and edges {(1,2),<br>(1,4), (2,1), (2,3), (3,2), (4,1)}.<br>2. Write a program that implements an adjacency matrix for an undirected and unweighted graph.<br>struct Node<br>( int Vertex;<br>Node* next;<br>};<br>Implement the following functions.<br>a. void printList (Node adjList[4])<br>b. //prints the vertices included in //an adjacency list<br>c. Test your program output with graph G that has 4 vertices (1, 2, 3, and 4) and edges {(1,2),<br>(1,4), (2,1), (2,3), (3,2), (4,1)}.<br>Sample Run:<br>Adjacency Matrix:<br>1 2 3 4<br>1 (0] (1] (0] (1)]<br>2 [11 (8] (1] (8]<br>3 [8] [1] [0J (0]<br>4 [1] (0] (0] (0]<br>Adjacency List:<br>(1, 2) (1, 4> (2, 1) (2, 3) (3, 2> (4, 1)<br>](https://s3.us-east-1.amazonaws.com/storage.unifolks.com/qimg-008/008_kjemzp0-xzl4wt5t.png)
Extracted text: 1. Write a program that implements an adjacency matrix for an undirected and unweighted graph. struct Edge { int vertexl; Int vertex2; } ; Implement the following functions. a. void insertEdge (Edge e, int adjMat[4] [4]); a. //Purpose: Store an edge defined by two vertices. b. void printGraph (int adjMat[4] [4]) a. //prints the edges included in an adjacency matrix c. Test your program output with graph G that has 4 vertices (1, 2, 3, and 4) and edges {(1,2), (1,4), (2,1), (2,3), (3,2), (4,1)}. 2. Write a program that implements an adjacency matrix for an undirected and unweighted graph. struct Node ( int Vertex; Node* next; }; Implement the following functions. a. void printList (Node adjList[4]) b. //prints the vertices included in //an adjacency list c. Test your program output with graph G that has 4 vertices (1, 2, 3, and 4) and edges {(1,2), (1,4), (2,1), (2,3), (3,2), (4,1)}. Sample Run: Adjacency Matrix: 1 2 3 4 1 (0] (1] (0] (1)] 2 [11 (8] (1] (8] 3 [8] [1] [0J (0] 4 [1] (0] (0] (0] Adjacency List: (1, 2) (1, 4> (2, 1) (2, 3) (3, 2> (4, 1)