This is a fairly straightforward question on maximization of regions of a Venn diagram. In all maximization and minimization questions, remember that it’s not about taking the largest or the smallest value. It’s about taking the largest of the smallest value that does not make any region of the Venn diagram negative.
Let us go ahead and draw the Venn diagram now:
Attachment:
22nd Nov 2019 - Reply 4.jpg [ 50.16 KiB | Viewed 12740 times ]
Since 1000 people visited the multiplex, the rectangle has 1000 people in total. The question also says that everyone watched at least one of the shows. This means everyone who visited the multiplex will be inside one of the circles. The area inside the rectangle but outside the circles will be ZERO.
In order to maximize the number of people who watched all 3, we will have to minimize the other regions. The minimum possible value of any region in a Venn diagram is 0. From the diagram, we see that the sum of the sets = 420 + 250 + 450 = 1120. But, the sum of the sets contains the regions a, b and c twice and the region x thrice.
If we remove a, b and c once and x twice from 1120, we get 1000 since this is the actual number of people who visited the multiplex (without repetition of any region). This means,
1120 –(a+b+c+2x) = 1000 which, on simplification, gives us,
a + b + c + 2x = 120. To maximize x, we take a+b+c = 0 and so, 2x = 120 or x = 60.
The correct answer option is C.
Hope this helps!