3. For the following graph, give an adjacency-list graph representation. 0 1 5 2 3 7 6 4 Using the representation, illustrate the operation of the depth-first search algorithm with vertex 0 as the source. Label or mark each vertex and edge appropriately. 5. a) Give the adjacency list representation of the following directed graph. b) Trace the topological sort (to the level of detail done in class) algorithm on the graph. Correspondingly, give the final order of the vertices. c) Are there any cycles? O 2 6 5 3 4