Quiz: Cycle Detection with DSU

You add edges one by one to an undirected graph using DSU. For edge $(u, v)$, find(u) and find(v) return the same root. What do you conclude?

1. A.Adding $(u, v)$ would create a cycle in the graph
2. B.Nodes $u$ and $v$ are directly connected by an existing edge
3. C.The graph has exactly $10$ connected components
4. D.You need to run union by rank before checking