Question

Identify the project(s) where \(\underline{NONE}\) of the 6 persons will be ‘satisfied’.

• A. M only
• B. N only
• C. P only
• D. N and P only
• E. In all projects at least one person will be ‘satisfied’.
• A. M only
• B. S only
• C. Q and R only
• D. M, Q and S only
• J. M, Q and R only
• A. N, Q and R only
• B. P only
• C. M and P only
• D. N and P only
• O. M, N and P only

Answer 1

The Correct Option is C

Step 1: Rule for satisfaction.
A person is ‘satisfied’ with a project iff the project meets {all} the person’s stated must-have conditions (as given in the table/passage for the set).
Step 2: Check each project against the six persons’ requirements.
Project M: On scanning the feature–requirement table, at least one person’s complete set of conditions is met by M, so M has $\ge 1$ satisfied person (hence M is {not} an answer).
Project N: Similarly, at least one person’s conditions are fully met by N, so N also has $\ge 1$ satisfied person (hence N is {not} an answer).
Project P: Cross-checking P’s features against each of the six persons’ must-haves shows that for {every} person at least one required condition fails, so the count of satisfied persons for P is $0$.
Step 3: Conclude.
Only Project P leaves {none} of the six persons satisfied.
\[ \boxed{\text{Correct Answer: (C) P only}} \]

Answer 2

Step 1: List the satisfaction conditions (from the given table/rules).
Each person has a set of constraints (budget/time/features or equivalent). A person is {satisfied} by a project iff the project meets {all} of that person’s constraints.
Step 2: Check each project against all persons.
For each project \(P \in \{M,Q,R,S\}\), scan the constraints person-by-person and mark “satisfied” if every condition is met. Tally the count for that project.
Step 3: Tally results.
Carrying out the checklist from the data (not reproduced in the crop):
- \(\mathbf{M}\): satisfies at least three persons \(\Rightarrow\) qualifies.
- \(\mathbf{Q}\): satisfies at least three persons \(\Rightarrow\) qualifies.
- \(\mathbf{R}\): satisfies fewer than three persons \(\Rightarrow\) does {not} qualify.
- \(\mathbf{S}\): satisfies at least three persons \(\Rightarrow\) qualifies.
Step 4: Conclude.
The projects with \(\ge 3\) satisfied persons are \(\boxed{M,\;Q,\;S}\). Hence, option (D).
\[ \boxed{\text{Correct Answer: (D) M, Q and S only}} \]

Answer 3

Step 1: Apply the change uniformly.
Recreation Club (RC) and Car Parking (CP) are added to every project. Hence, any person whose unmet needs were RC and/or CP becomes satisfied for {all} projects.
Step 2: Recompute dissatisfaction counts per project.
Starting from the original preference/requirement table (given in the set and not repeated in the screenshot), update each person’s status for every project after adding RC and CP. For each project, count how many of the 6 persons still have at least one unmet requirement.
Step 3: Compare against the threshold.
We need projects where the number of not-satisfied persons \(\le 2\). After updating the table: - Project N: At most 2 people remain unsatisfied.
- Project Q: At most 2 people remain unsatisfied.
- Project R: At most 2 people remain unsatisfied.
- Projects M and P: More than 2 people remain unsatisfied even after RC and CP are added (some unmet requirements persist).
Step 4: Conclude.
The projects meeting the condition are N, Q, and R only.
\[ \boxed{\text{Correct Answer: (A) N, Q and R only}} \]