Consider the graph shown on the right. Find the strongly connected components of the graph. For full credit, a) (6 points) Run DFS on the reverse graph, showing the discovery and finish times of each vertex. b) (6 points) Run DFS again, to discover the strongly connected components. What is the order the components are discovered? c) (3 points) Draw the DAG of the components. What is the minimum number of edges that can be added to make the entire graph strongly connected? 12 13 18 17 10 16