The adjacency matrix has a problem: it takes up a lot of space in memory. The adjacency list stores the edges in an array of linked lists. This uses less memory but makes it harder to find edges. Here are two examples: D ) | A B C B,C A,C,D A,B,D B,C | LA (B,5) (2,9), (D,4) (D,1) . (A,2) (a) (8 points) Write the adjacency list of the following graph. 0 0 (b) (8 points) Write the adjacency list of the following graph