Zeal Test Series 2019: Graph Theory - Graph Connectivity

Question

i didn't read the concept related to strongly connected components please it describe it for this question

Comments

4 SCC

---

and after adding edge SCC become 2

---

i think option (d) is correct counter example for statement (2) is consider the graph ABCD where path can be given as

$A\rightarrow B ,B\rightarrow C, C\rightarrow D ,A\rightarrow D$ now here there is zero strongly connected component but when we add an edge $C\rightarrow A$ there will be one strongly connected component i.e ABC.