Represent the following graph using the following:

$($a$)$ Adjacency Matrix

$($b$)$ Adjacency Graph

$($a$)$ Assume that a vertex index requires two bytes, a pointer requires four bytes, and an

edge weight requires two bytes. How much memory will be required to store the directed

graph using an Adjacency Matrix and an Adjacency Graph?

$($b$)$ Repeat assuming the graph is undirected.