Given an undirected graph G$($V$,$ E$),$ with $|$V$|$ vertices and $|$E$|$ edges, thelength of the longest linked list in Gs adjacency list is:

a$.|$V$|$

b$.|$E$|$

c$.2*|$E$|$

d$.2*|$V$|$

e$.|$V$|^2$