Find the strongly connected components of each of these graphs

Suppose that G $=($V$,$ E$)$ is a directed graph. A vertex w in V

is reachable from a vertex v in V if there is a directed path

from v to w$.$ The vertices v and w are mutually reachable if

there are both a directed path from v to w and a directed path

from w to v in G$.$