Problem 4. Suppose we represented graphs with a list of adjacency lists, instead of an array of adjacency lists. Give asymptotic bounds for the space complexity of this representation, for the time complexity of the lookup operation (checking for an edge from u to v), and for the time complexity of the insertion and deletion operations for both edges and vertices. What are the advantages and disadvantages over the representation by an array of adjacency lists