WARNING! Read the conditions for the problems in this set very carefully! Assume for an undirected graph with $8$ vertices and $19$ edges that a vertex index requires $3$ bytes, and a pointer requires $4$ 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.