9. Consider the following directed graph G. 5 (a) Perform a DFS traversal on G starting at vertex 1. Assume that, in the traversal, the adjacent vertices are visited in the increasing order of vertex labels. Compute the preorder and postorder listing of the vertices. [3 Marks Traversal Preorder l Postorder Sequence (b) Using Kosaraju's algorithm, compute the strongly connected components of G 2 Marks