Consider the following directed graph. A B F E D (a) (+5) Draw the adjacency list representation where the vertices are indexed in alphabetical order in the list array and that each list is ordered alphabetically. (b) (+10) Perform DFS to compute the discovery time and finishing time for each of the vertices, using the alphabetical adjacency list representation you stated on Part (a). Mark these times on the picture above. (c) (+5) Identify the tree edges and back edges on the picture above. G