Step 1: Understanding the Question:
This is a coding-decoding problem based on sentence-level encryption.
A set of words is mapped to a set of code letters. The order of words does not necessarily match the order of the codes.
By comparing common words and common codes across different sentences, we can systematically isolate the code for each individual word.
Step 2: Detailed Explanation:
• Write Down the Code Equations:
1. "Red butterfly is beautiful" $\rightarrow \{P, X, Y, Z\}$
2. "Beautiful red flowers" $\rightarrow \{L, P, Z\}$
3. "flowers are red" $\rightarrow \{Q, P, L\}$
• Find the Code for "Red":
The word "red" is common to all three sentences.
The only code letter present in all three code sets is $P$.
Therefore:
\[ \text{Red} \rightarrow \text{P} \quad \text{(B matches with IV)} \]
• Find the Code for "Beautiful":
Comparing Sentence 1 and Sentence 2, the common words are "beautiful" and "red".
The common codes are $P$ and $Z$.
Since $P$ is "red", the code for "beautiful" must be $Z$.
Therefore:
\[ \text{Beautiful} \rightarrow \text{Z} \quad \text{(A matches with I)} \]
• Find the Code for "Flowers":
Comparing Sentence 2 and Sentence 3, the common words are "flowers" and "red".
The common codes are $P$ and $L$.
Since $P$ is "red", the code for "flowers" must be $L$.
Therefore:
\[ \text{Flowers} \rightarrow \text{L} \quad \text{(D matches with II)} \]
• Find the Code for "Are":
In Sentence 3, "flowers are red" is coded as $\{Q, P, L\}$.
Since we know "flowers" $\rightarrow L$ and "red" $\rightarrow P$, the remaining word "are" must be coded as the remaining letter $Q$.
Therefore:
\[ \text{Are} \rightarrow \text{Q} \quad \text{(C matches with III)} \]
Step 3: Final Answer:
The matching pairs are:
A $\rightarrow$ I
B $\rightarrow$ IV
C $\rightarrow$ III
D $\rightarrow$ II
This combination corresponds to option (A).