Data structure

2. (10 points) If a graph has V vertices and E edges, what is the space requirement (big-O notation is fine) for representing this graph as an adjacency matrix? As an adjacency list? If we perform a topological sort on a sparse graph, which representation should we use and why