A graph G has the property that every two vertices are connected by an edge. Which

representation is the most suitable for G:

a$)$ adjacency list

b$)$ adjacency tree

c$)$ adjacency matrix

d$)$ adjacency heap

e$)$ None of the above.