To determine the number of individuals who prefer both tea and coffee, the principle of inclusion-exclusion will be applied.
- Total individuals surveyed: 50
- Individuals who prefer tea (T): 30
- Individuals who prefer coffee (C): 25
- Individuals who prefer neither: 10
- The formula for the union of two sets is:
\[
|T \cup C| = |T| + |C| - |T \cap C|
\]
- The count of people who like tea or coffee or both is calculated by subtracting those who like neither from the total number of people.
Total individuals = 50
Individuals liking neither = 10. Therefore, individuals liking tea or coffee or both = 50 - 10 = 40.
Number liking tea (T) = 30
Number liking coffee (C) = 25
The number of people who like tea or coffee or both is 40. Using the union formula: \[ |T \cup C| = 40 = 30 + 25 - |T \cap C| \] Solving for the number of people who like both: \[ |T \cap C| = 30 + 25 - 40 = 15 \]
There are 15 individuals who like both tea and coffee.
The speed-density relation on a one-way, single lane road is shown in the figure, where speed \( u \) is in km/hour and density \( k \) is in vehicles/km. The maximum flow (in vehicles/hour) on this road is

Let \( A = \{-3, -2, -1, 0, 1, 2, 3\} \). A relation \( R \) is defined such that \( xRy \) if \( y = \max(x, 1) \). The number of elements required to make it reflexive is \( l \), the number of elements required to make it symmetric is \( m \), and the number of elements in the relation \( R \) is \( n \). Then the value of \( l + m + n \) is equal to: