Problem 1 Consider the graph shown on the right. Find the strongly connected components of the graph. Whenever you use DFS and there is a choice of nodes to explore, always pick the one that is alphabetically first. a) Run DFS on the reverse graph starting at node A. Show the discovery and finish times of each vertex. b) Run DFS again to discover the strongly connected components. What is the order the components are discovered? c) Draw the DAG of the components. Now topologically sort this DAG by running DFS and computing the discovery/finish time of the nodes. Identify all source and sink components.

Fig: 1