The goal of Kosaraju-Sharir's algorithm is to find all strongly connected components (SCCs) of a given input graph. Please take into consideration the directed graph provided below and select the appropriate alternative about the decomposition of the graph into SCCs using this algorithm A. Starting from A and using alphabetical order to apply the DFS, node G has shorter (equal to 4) finishing time. B. Each node of the graph is a strongly connected component. C. Starting from A and using alphabetical order to apply the DFS, node A has longer (equal to 10) finishing time. D. {A, B, C, G, F}, {D}, and{E} are strongly connected components of the presented graph. E. None of the above. Original idea by: Karla Florentino .