Run the strongly connected components algorithm on the following directed graph G. When doing DFS on GR: whenever there is a choice of vertices to explore, always pick the one that is alphabetically first. A: B, F B: C.G C: D.H D: E. H,IJ E:J F:G G: A, H H:C I:J J: E (a) (5 points) In what order are the strongly connected components (SCCs) found? (b) (5 points) Which are source SCCs and which are sink SCCs? (c) (5 points) Draw the "metagraph" (each meta-node is an SCC of G)