Can you Please Properly Solve this for me, Thanks! Work on Java to implement a Graph using an adjacency list with the following methods: - Insert an edge between two vertices x and y. [ addEdge (x,y) ] - Determine the degree of a vertex x. [degreevertex (x) ]//This returns the number of neighbors for a given vertex x. - Show the adjacent vertices of a vertex x. [printAdjVertices (x) ] Provided with an undirected graph, you need to create its corresponding adjacency list using the Graph implementation above and print its vertices using Breadth First Search [BFS] and Depth First Search [DFS]. Input The number of vertices and edges are represented by the two integers n and e in each test case. The next e lines show the vertices that are connected by an edge. Example: Output The Final Output should show : - Sample Output (BFS) - Sample Output (DFS) - Degree of vertex - Adjacent vertices of vertex Note: Use Scanner Method so I can test different Sample Inputs. Also provide the code in proper format and comments that I can copy and understand properly. Please show output as well