1. (Strongly Connected Components, 25 points) Run the strongly connected compo- nents algorithm on the following directed graphs G. When running DFS on GR, whenever there is a choice of vertices to explore, always pick the one that is alpha- betically first Kb c 9 In each case answer the following questions. (Note that you DO NOT need to include all the steps of the sample runs in your solution.) (a) (6 points) In what order are the strongly connected components (SCCs) found? (b) (6 points) Which are source SCCs and which are sink SCCs? (e) (6 points) Draw the (d) (7 points) What is the minimum number of edges you must add to this graph "m etagraph" (each meta-node is an SCC of G). to make it strongly connected