You have the following adjacency matrix for a graph. However, some of the entries are missing.

Your job is to find these missing entries with the help of some clues. Then draw the graph.

a$)$ Is an adjacency list more memory efficient than an adjacency matrix?

b$)$ Justify your reasoning with respect to directed vs undirected, weighted vs

unweighted, sparse vs dense graphs.