Space complexity for an adjacency list of an undirected graph having large values of V (vertices) and E (edges) is __________

• A. O(V)
• B. O(E*E)
• C. O(E)
• D. O(E+V)