Cannot be determined
- Step 1: Recall constraints. X not on P2. Y not on P3. Each project gets one employee.
- Step 2: Use Question 23 solution. Z is on P2.
- Step 3: Assign P3. Y cannot be on P3, so P3 is X or Z. Since Z is on P2, P3 must be X.
- Step 4: Assign P1. P1 gets Y (only remaining employee).
- Step 5: Verify. Assignment: X-P3, Y-P1, Z-P2. Constraints: X not on P2 (satisfied), Y not on P3 (satisfied).
- Step 6: Final conclusion. Option (1) X is the correct answer.





For any natural number $k$, let $a_k = 3^k$. The smallest natural number $m$ for which \[ (a_1)^1 \times (a_2)^2 \times \dots \times (a_{20})^{20} \;<\; a_{21} \times a_{22} \times \dots \times a_{20+m} \] is: