Quiz: SCC Problem Solving

In the Flight Routes Check problem, you want to verify that every city can reach every other city. You find $3$ SCCs. Can the answer be "yes"?

1. A.Yes, if the SCCs are connected in a chain
2. B.No, because more than $1$ SCC means some pair of cities lacks mutual reachability
3. C.Yes, if every SCC has at least $2$ nodes
4. D.It depends on the number of edges between SCCs