Consider an undirected graph G$,$ in which the edge e connects vertex v and vertex w$.$ Which of the following is not true for the adjacency list representation of G$?$

Group of answer choices

The representation of G includes a list with all the Vertex objects.

There is no Edge object that represents e$.$

The Vertex object that represents v can be reached from the Edge object that represents e$.$

A reference to the Edge object representing e can be accessed from the Vertex object representing v$,$ and from the Vertex object representing w$.$