Concept:
In coding-decoding, to identify the code of a word, we compare common words in multiple statements and find their common codes.
Step 1: Checking Statement (I).
Given:
\[
\text{ROSES ARE BEAUTIFUL} \rightarrow Za\;Yb\;Xc
\]
Words:
\[
\text{ROSES, ARE, BEAUTIFUL}
\]
Codes:
\[
Za,\;Yb,\;Xc
\]
But we do not know which code corresponds to BEAUTIFUL.
Thus, Statement (I) alone is not sufficient.
Step 2: Checking Statement (II).
Given:
\[
\text{GIRLS ARE BEAUTIFUL} \rightarrow Xc\;Za\;Wd
\]
Words:
\[
\text{GIRLS, ARE, BEAUTIFUL}
\]
Codes:
\[
Xc,\;Za,\;Wd
\]
Again, BEAUTIFUL cannot be uniquely identified.
Thus, Statement (II) alone is not sufficient.
Step 3: Checking both statements together.
Common words in both statements:
\[
ARE,\; BEAUTIFUL
\]
Common codes in both statements:
\[
Za,\; Xc
\]
But since there are two common words and two common codes, we cannot uniquely assign which code belongs to BEAUTIFUL.
Hence, additional data are required.