Imagine a simple undirected graph with the maximum number of…
Imagine a simple undirected graph with the maximum number of edges. Which representation would be the better option for this graph: an adjacency matrix or an adjacency list? Justify your answer, including the time complexity for edge lookup AND the space complexity (in Big O) of the data structures. Use n for the cardinality of the set of vertices, and m for the cardinality of the set of edges.