I only need questions b, d, e answered

3. (20 points) For each of the six questions in parts (a) - (c), answer in terms of big-Oh and the number of vertices in the graph IVI. (a) Suppose a graph has no edges. i. What is the asymptotic space cost of storing the graph as an adjacency list? ii. What is the asymptotic space cost of storing the graph as an adjacency matrix? (b) Suppose a graph has every possible edge. i. What is the asymptotic space cost of storing the graph as an adjacency list? ii. What is the asymptotic space cost of storing the graph as an adjacency matrix? (c) Suppose an undirected graph has one node A that is connected to every other node and the graph has no other edges. i. What is the asymptotic space cost of storing the graph as an adjacency list? (d) Is an adjacency list faster or slower than an adjacency matrix for answering queries of the form, (e) Is an adjacency list faster or slower than an adjacency matrix for answering queries of the form, Solution: CA ii. What is the asymptotic space cost of storing the graph as an adjacency matrix? "is edge (u, v) in the graph"? are there any directed edges with u as the source node