Let G be a graph with V vertices and E edges. The Time complexity to find if there is an edge between 2 particular vertices with an adjacency list is: V+E1VE Question 16 (17.5 points) Saved Suppose a graph is stored as an adjacency matrix. The time complexity to calculate the number of edges in the graph is: whose information in stored in form of an adjacency matrix is VV2EE2 Question 17(17.5 points) Saved Recall that A bridge (or cut edge) is an edge whose removal disconnects the graph. In the above graph, which of the following edges are not bridges. a. AB b. BD c. BC a,b b,c a,b,c a,c Question 18 (17.5 points) Saved Given a graph that is a tree (connected and acyclic)..