In a certain coding scheme, each word is encoded by replacin

[sanjib]

In a certain coding scheme, each word is encoded by replacing each letter in the word with another letter. The same code is used for all words, so that the same letter replaces a given letter each time the given letter occurs. What code will result when the word TAME is encoded by this scheme?
(1) When the word MAT is encoded, the result is DLX.
(2) When the word TEA is encoded, the result is XRL.
Please need professional help

[eric.gordon884]

This strikes me as simple decoder ring stuff - each letter is replaced by a fixed corresponding letter. The trick is to find out which is which.

To encode the word TAME, you need to know the corresponding letters for T, A, M, and E.

(i) only provides the letters M(->D), A(->L), and T(->X). You cannot encode TAME because you don't know what E is.

(ii) only provides the letters T(->X), E(->R), and A(->L). You cannot encode TAME because you don't know what M is.

(i)+(ii) you have all letters and can encode TAME -> XLDR.

The answer is C.

[sanjib]

Right ,thank you . The OA is C