We’re asked for: the minimum number of students who did not clear cutoff in exactly two subjects (i.e., they cleared exactly one subject).
Set up the Venn regions (DI, VA, QA):
Let Only DI = x, Only VA = y, Only QA = 5 (given).
Let (DI ∩ VA only) = p, (DI ∩ QA only) = q, (VA ∩ QA only) = r, and (All three) = 40 (given).
Also given: VA ∩ QA (including the triple) = 50, total QA = 60, total DI = 80, total VA = 70, and 10 students are outside all three.
Step 1 — Resolve pairwise regions using the givens:
VA ∩ QA (including triple) = 50 ⇒ (VA ∩ QA only) + (All three) = r + 40 = 50 ⇒ r = 10.
QA total: 60 = (Only QA) + (DI ∩ QA only) + (VA ∩ QA only) + (All three)
60 = 5 + q + 10 + 40 ⇒ q = 5.
Step 2 — Express DI and VA totals to relate x, y, p:
DI total: 80 = (Only DI) + (DI ∩ VA only) + (DI ∩ QA only) + (All three)
80 = x + p + 5 + 40 ⇒ x + p = 35 ⇒ x = 35 − p.
VA total: 70 = (Only VA) + (DI ∩ VA only) + (VA ∩ QA only) + (All three)
70 = y + p + 10 + 40 ⇒ y + p = 20 ⇒ y = 20 − p.
Step 3 — Link “failed in exactly two subjects” to “cleared exactly one”:
Failing in exactly two subjects means clearing exactly one subject. Hence the required count = (Only DI) + (Only VA) + (Only QA).
Therefore, Required = x + y + 5 = (35 − p) + (20 − p) + 5 = 60 − 2p.
Step 4 — Minimize the required count by maximizing p (feasibility constraints):
We must keep each region non-negative: x ≥ 0 ⇒ 35 − p ≥ 0 ⇒ p ≤ 35; y ≥ 0 ⇒ 20 − p ≥ 0 ⇒ p ≤ 20; also p ≥ 0.
Thus the maximum feasible p is p = 20 (the tighter bound).
Step 5 — Compute the minimum:
Minimum (x + y + 5) = 60 − 2p = 60 − 2·20 = 20.
Conclusion: The minimum number of students who did not clear cutoff in exactly two subjects (i.e., cleared exactly one subject) is 20.
The correct option is (C): 20