Compare adjacency matrix with adjacency list where n is the number of vertices and m is the number of edges. Assuming it takes O$(1)$ time to print an edge. True or False: If we use an adjacency matrix to store the graph, we need $\backslash$Omega $($n$^2)$ time to print all edges. True or False: If we use an adjacency list to store the graph, we need O$($m$)$ time to print all edges. Explain your answer."