1. What are the trade-offs between the adjacency matrix and adjacency list representations? In particular, for each of these representations a. What is the best- and worst-case space complexity? b. What is the runtime (best- and worst-case) for determining whether two arbitrary vertices are adjacent? c. What is the runtime (best- and worst-case) for adding an edge to a graph? d. What is the runtime (best- and worst-case) for adding a new node to a graph? e. What other trade-offs do you see between these two representations