Identify the number of Strongly Connected Components

 Given the following reverse graph below, alongside its reverse order of finishing times (DFS starting at node 1), please, identify the number of strongly connected components in the original graph, using the Kosaraju-Sharir’s algorithm:

A. 3

B. 4

C. 2

D. 5

E. None of the above.

Original idea by: Felipe Crispim da Rocha Salvagnini