exercises for help with exercisesplease visit the sitewww wiley com/college/goodrich reinforcement - draw simple undirected graph that has vertices edgesand connected components - if is simple undirected graph with vertices and connected componentswhat is the largest number of edges it might haver- draw an adjacency matrix representation of the undirected graph shown in figure - draw an adjacency list representation of the undirected graph shown in figure - draw simpleconnecteddirected graph with vertices and edges such that the in-degree and out-degree of each vertex is show that there is single (nonsimplecycle that includes all the edges of your graphthat isyou can trace all the edges in their respective directions without ever lifting your pencil (such cycle is called an euler tour - suppose we represent graph having vertices and edges with the edge list structure whyin this casedoes the insert vertex method run in ( time while the remove vertex method runs in (mtimer- give pseudo-code for performing the operation insert edge( , ,xin ( time using the adjacency matrix representation - repeat exercise - for the adjacency list representationas described in the - can edge list be omitted from the adjacency matrix representation while still achieving the time bounds given in table why or why notr- can edge list be omitted from the adjacency list representation while still achieving the time bounds given in table why or why notr- would you use the adjacency matrix structure or the adjacency list structure in each of the following casesjustify your choice the graph has , vertices and , edgesand it is important to use as little space as possible the graph has , vertices and , , edgesand it is important to use as little space as possible you need to answer the query get edge( ,vas fast as possibleno matter how much space you use