Graph algorithms
Considering the graph below and using the Kosaraju-Sharir algorithm, in alphabetical order, we can determine which of the following statements are correct:] A) 1 SCCs returned: BED B) 4 SCCs returned: A first, then BED, C, and F C) 4 SCCs returned: F first, then C, BED, and A D) The largest SCC contains 2 nodes E) None of the above. Original idea by: Caroline Nakazato