Difficulty: Medium
Correct Answer: Only II
Explanation:
Introduction / Context:This is a data-sufficiency problem on coded language mapping. We must identify which statement(s) are sufficient to determine which single letter corresponds to the word 'We' when the code 'XYZ' translates to 'We are friends'.
Given Data / Assumptions:
Concept / Approach:Use intersection logic: if two codes share common letters and the corresponding phrases share common words, then the common letter maps to the common word. We only need enough information to isolate the word 'We' from the other words.
Step-by-Step Solution:
From Statement II: ZMS → 'We love them'.Comparing with XYZ → 'We are friends', the only common word is 'We', and the only common letter between the two codes is 'Z'.Therefore, Z ↔ 'We' directly from Statement II alone.Statement III: PX → 'Hello friends' shows that X ↔ 'friends' (common word 'friends' appears with X in XYZ), but this is not needed once Statement II is used.Statement I provides no overlap with the target words and does not help identify 'We'.Verification / Alternative check:With II alone we conclude Z = 'We'. Cross-check with III: since PX = 'Hello friends', X = 'friends'; thus in XYZ, X = 'friends', Z = 'We', leaving Y = 'are', which is consistent. I adds nothing.
Why Other Options Are Wrong:
Common Pitfalls:Assuming letter order equals word order, or trying to use Statement I which has no shared words. Focus on shared elements between codes and phrases.
Final Answer:Only II
Discussion & Comments