(a) provide an adjacency list representation for this graph. In each list, please order alphabetically. (b) (10 points) Using your answer to (a), please show the d and a values that result from breadth-first search, starting from vertex A. Please also show the breadth-first tree that is generated. (c) (10 points) Using your answer to (a), show how depth-first search works on this graph. Specifically, please show the discovery and finish times for each vertex and the classification of each edge. You can assume that the for loop in lines 5-7 of the DFS procedure considers vertices in alphabetical order. A F 4 B G K 10 H 2 L D I Figure 1: An undirected graph 3 E N J