In a certain coding scheme

[nhai2003]

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 help guys
Such a difficult question, I don't even understand the wording of the question.

[sreak1089]

Even though this Qn looks complex, its quite simple in my opinion.
we need to find encoding for TAME.

stm# 1: MAT is encoded, the result is DLX

=> M=D, A=L, T=X, but we dont have encoding for E in the word 'TAME'

stm# 2 is NOT sufficient.

stm# 2: TEA is encoded, the result is XRL.

=> T=X, E=R, A=L, but we dont have encoding for M in the word 'TAME'.

Together we have encoding for TAME which is 'XLDR'.