Appreciate a step by step explanation with code for this problem.

In this problem you will implement a linear time strongly connected components algorithm, like Tarian's or Kosaraju s Algorithm using Python. Given an undirected graph G you first create the reverse graph GE in linear time. Next, you run an undirected connected components method processing the vertices in decreasing post order. This method utilizes a depth-first search is trivially adapted to check if a graph is connected and, more generally, to assign each node v an integer ccnumlv identifying the connected component to which it belongs.Its pseudocode can be shown as: procedure previsit(v) where cc needs to be initialized to zero and to be incremented each time the DFS procedure searches the graph. The overall program should be carried out in OIV+E time. Vis #of vertices and E is of edges. The Python script should read the graph file name from the command line. Each line of the graph file will have two integers representing a direpted edge from u to v The code should output all strongly connected components