0 VARISHA PARVEZ Asked: May 5, 2023In: Programs/CodesWhich of the following is an algorithm for finding all the strongly connected components of a directed graph? a) Breadth-first search b) Depth-first search c) Tarjan's algorithm d) Dijkstra's algorithm0algorithmit languageprogramming