a. List both the advantages and disadvantages of adjacency list and adjacency matrix for the graph representation, respectively. b. Analyze the complexity of depth-first search (DFS) on a graph represented by the adjacency list or adjacency matrix, respectively.