Apply STRONGLY$-$CONNECTED$-$COMPONENTS algorithm to the graph below to identify its connected

components and the nodes within each component. You need to show the intermediate steps.

STRONGLY$-$CONNECTED$-$COMPONENTS $($G$)$

Call DFS $($G$)$ to compute finishing times $f(u)$ for each vertex $u$

Compute $G^T$

Call DFS $(G^T),$ but in the main loop of DFS$,$ consider the vertices in order of decreasing $f(u)$

Output the vertices of each tree in the depth$-$first forest formed in line $3$ as a separate strongly connected component

Start at node a

Note: in case there are multiple adjacent nodes, select the one that comes first in the alphabet.