Consider a graph G = (V, E) with n vertives. For each of the three cases provided below, answer the following questions: (1) What would be the graph's adjacency matrix representation look like? What is the asymptotic space cost of storing G using this represenation, using notation in terms of n only? (2) What would be the graph's adjacency lists representation look like? What is the asymptotic space cost of storing G using this represenation, using notation in terms of n only? a. (4 points) Suppose E = 0. b. (4 points) Suppose G is an undirected graph with E = {(u, v)|u, ve V, u v}. That is, there is an edge between every pair of distinct vertices. c. (4 points) Suppose G is a digraph with E= {(s, v)|v V, v s} for one vertex s V. That is, s is connected to every other vertex in G.