Recall that Kosaraju's algorithm involves two DFS passes: the first to determine the order of processing vertices, and the second to identify SCCs in the reversed graph.

Consider how the finishing times from the first DFS pass influence the order in which vertices are processed in the second pass on the transposed graph.

Analyze how the structure of the DFS forest in the first pass (specifically, the roots of the trees) relates to the SCCs identified in the second pass.