Consider the following directed graph G. (8 5 7 4F (to (3 6 2 (a) Perform a DFS traversal on G starting at vertex 1. The traversal must visit all the vertices of G. 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 Postorder Sequence (b) Using the postorder listing obtained Part (a) and Kosaraju's algorithm, compute the strongly connected components of G. You have to list the strongly connected components in the order in which they are output by the algorithm. [2 Marks]