Please help with this, provide detailed explaination.

Strongly Connected Components: Consider the following directed graph with $8$ nodes: A$,$ B$,$ C$,$ D$,$ E$,$ F$,$ G$,$ H$.$ The directed edges are: $($A$,$ E$),($A$,$ F$),($B$,$ H$),($C$,$ D$),($D$,$ E$),($D$,$ F$),($F$,$ C$),($G$,$ B$),($H$,$ C$),($H$,$ G$).$ Determine the strongly connected components in the graph using the algorithm we have learned.