$1.$ Given an undirected graph G with n vertices:

$($a$)$ If the graph is represented as an adjacency matrix, what is the maximum number of $1\text{'}$s possible in the matrix?

$($b$)$ If G has exactly e edges, how many $1\text{'}$s will be in its adjacency matrix?$$

$($c$)$ For the same graph, compare the space complexity when stored as an adjacency matrix versus an adjacency list.