Consider the following graph G:

Find the strongly connected components (SCC) in G.

Note: Provide the SCC found in alphabetical order, so the first component will start with node A, the second one will start with the next available node of the next unused letter in the alphabet, etc. If no more SCC were found, select "N/A" as answer. For example, if detected [AF, BC, DE], the first one would be AE because its has A, the second SCC would be BE because of B, the third one would be DE because of D.

1.What's the first SCC?

2. What's the second SCC found?

3. What's the third SCC found?

4. What's the fourth SCC found?

5. In the transpose graph of G, there's an edge from A->E.

6. In the transpose graph of G, there exists the cycle BCF

7. In the transpose graph of G, there exists the cycle ACE