1. Find the number of vertices, the number of edges and the degree of each vertex in thegiven undirected graph.(a) (b)2. Determine the number of vertices and edges and find the in-degree and out-degree ofeach vertex for the given directed multigraph.(a) (b)3. Use the adjacency list and adjacency matrix to represent the graphs of question 1(b)and 2(b).

Consider a simple undirected graph with 6 vertices. The degrees of the vertices in this graph are as follows: vertex A has degree 3, vertex B has degree 2, vertex C has degree 4, vertex D has degree 3, vertex E has degree 3, and vertex F has degree 1. Calculate the number of edges in the graph.a.6b.7c.8d.12

What is the degree of a vertex in a graph?a) Number of edges connected to the vertexb) Number of vertices in the graphc) Number of self-loopsd) Number of paths through the vertex

In an undirected graph, the degree of a vertex is:A. The number of edges incident to the vertexB. The number of vertices adjacent to the vertexC. The sum of the degrees of all verticesD. The product of the degrees of all vertices

In a simple undirected graph, the minimum degree is 2 and the maximum degree is 5. Which of the following statements is true?a.The graph must have a vertex of degree 3b.The graph must have a vertex of degree 6c.The graph must have a vertex of degree 4d.The graph must have a vertex of degree 7

The adjacency matrix of an undirected graph with 𝑛n vertices has how many entries?A. 𝑛nB. 𝑛2n 2 C. 2𝑛2nD. 𝑛−1n−1