let g be a graph on a vertices and n(n-1)/2 edges. Which of the following is correct?

a. Adjancy matrix representation of G requires O(1) storage

b. Adjancy matrix representation of G requires O(n) storage

c. Adjancy matrix representation of G requires O(n^2) storage

d. Adjancy matrix representation of G requires O(nlogn) storage