If a graph is stored as an adjacency matrix with n nodes, how much memory, in terms of n, must be allocated for the matrix?
a. n²
b. log n
c. n
d. n!