1. (16 points) For this problem, consider the two main ways of representing a graph: adjacency lists, or adjacency matrix. a. Of the two representations, which would be more efficient at removing an edge from the graph? Explain your answer by describing what must be done (e.g., pseudocode) in each of the two representations, and giving the asymptotic (big-theta) running times. b. Of the two representations, which would be more efficient at removing an vertex from the graph? Explain your answer by describing what must be done (e.g., pseudocode) in each of the two representations, and giving the asymptotic (big theta) running times