To solve the problem, we need to find the number of people who like both tea and coffee using the principle of inclusion-exclusion.
- Total People: 50
- Number liking tea (T): 30
- Number liking coffee (C): 25
- Number liking neither: 10
- Use the formula for union:
\[
|T \cup C| = |T| + |C| - |T \cap C|
\]
- People liking tea or coffee or both = total - neither
Total people = 50
Neither = 10 → People liking tea or coffee or both = 50 - 10 = 40
Tea (T) = 30
Coffee (C) = 25
\[ |T \cup C| = 40 = 30 + 25 - |T \cap C| \] \[ |T \cap C| = 30 + 25 - 40 = 15 \]
The number of people who like both tea and coffee is 15.
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:
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