Consider the undirected graph shown. (a) Assign directions to the edges such that the resulting directed graph is a directed acyclic graph with a topological sort given by: 4 8 6 1 3 2 5 7 (b) Without running DFS, what can you say about the strongly connected components of the directed graph obtained in (a)? 1 2 6 7 5 4 3 8