Consider the undirected graph: A / \ E D \ / C | B Which of the following is a valid adjacency list representation of the above graph?

Consider the following directed graph: A / \ E D \ / C | B E->A D->A C->E C->D B->C Which of the following is the adjacency matrix for this graph?

Problem StatementImplement a Graph using an Adjacency List. Given the number of vertices (V) and the edges, create an undirected graph using an adjacency list. Print the adjacency list of each vertex.Input format :The first line of input consists of an integer V, representing the number of vertices.The second line consists of an integer E, representing the number of edges.The following E lines consist of the edge information.Output format :The output prints the adjacency list of each vertex.Refer to the sample output for formatting specifications.Code constraints :1 ≤ V ≤ 1001 ≤ E ≤ 100Sample test cases :Input 1 :570 10 41 21 31 42 33 4Output 1 :Adjacency list of vertex 0head -> 1-> 4Adjacency list of vertex 1head -> 0-> 2-> 3-> 4Adjacency list of vertex 2head -> 1-> 3Adjacency list of vertex 3head -> 1-> 2-> 4Adjacency list of vertex 4head -> 0-> 1-> 3Input 2 :671 31 41 52 32 42 54 6Output 2 :Adjacency list of vertex 0head Adjacency list of vertex 1head -> 3-> 4-> 5Adjacency list of vertex 2head -> 3-> 4-> 5Adjacency list of vertex 3head -> 1-> 2Adjacency list of vertex 4head -> 1-> 2-> 6Adjacency list of vertex 5head -> 1-> 2Note :The program will be evaluated only after the “Submit Code” is clicked.Extra spaces and new line characters in the program output will result in the failure of the test case.

Create an adjacency list based on the given graph.

Which of the following ways can be used to represent a graph?a)Adjacency List and Adjacency Matrixb)None of the mentionedc)Incidence Matrixd)Adjacency List, Adjacency Matrix as well as Incidence Matrix

Consider the below-directed graph and choose the right option for its representation of the adjacency matrix.OptionsBothNone