(12 pts) Multiple Choices. There is one and only one correct answer to each of the following questions of the following statements about adjacency-list representations and the adjacency- matrix representations for graphs is TRUE? a. Adjacency-list representations usually require more storage space as adjacency- matrix representations b. Adjaceney-list representations are not as efficient as adjacency-matrix representa- tions for implementing the breadth-first search algorithm c. Adjacency-list representations are not as efficient as adjaceney-matrix representa- tions for implementing the depth-first search algorithm. d. Adjacency-list representations are not as efficient as adjacency-matrix representa- tions for checking whether an edge (u, v) exists in a graph G