An undirected graph, G$,$ is represented using the adjacency list discussed in class. Assume that:

$-$ G has $20$ vertices

$-$ each vertex has exactly $5$ neighbors $($do not worry about whether or not this is possible. Assume it is$.)$

$-$ an int is $2$ Bytes

$-$ a pointer is $8$ Bytes

$-$ the definition for the nodes used in the adjacency lists is:

struct node $\{$

int vertex;

struct node$*$ next;

$\}$

Give the number of Bytes needed to store the the edge information for this graph.

$1000,1200,$ and $800$ are wrong answer choices