WARNING! Read the conditions for the problems in this set very carefully!

Assume for an undirected graph with numV vertices and numE edges that a vertex index requires vertB bytes, and a pointer requires pointerB bytes. The graph is unweighted, so assume that each matrix element stores one byte to represent the edge. Since the graph is undirected, each undirected edge is represented by two directed edges. Calculate the byte requirements for an adjacency matrix.

ANS