If the word PONDERS is coded as ONMCDQR (each letter is replaced by the immediately previous letter in the alphabet, for example P→O, O→N, N→M, etc.), then how will the word MAT be coded using the same previous-letter coding rule?

Introduction / Context:
This is a letter-coding question where each letter is transformed using a fixed alphabet relation. The example indicates that every original letter is replaced by the letter immediately before it in the English alphabet (a backward shift of 1).

Given Data / Assumptions:

• PONDERS is coded as ONMCDQR.
• Rule: each letter becomes the previous alphabet letter.
• Alphabet is cyclic: A becomes Z when shifted backward by 1.
• Apply the same rule to MAT.

Concept / Approach:
Identify the shift from the example. Here, P→O and O→N clearly show a backward movement by 1 position. Apply the same backward shift to each character of the target word.

Step-by-Step Solution:
Rule: Replace each letter with the previous letter in the alphabet. M → L (previous of M is L) A → Z (previous of A is Z) T → S (previous of T is S) So MAT → LZS.

Verification / Alternative check:
Quick check using positions: M(13) becomes L(12), A(1) becomes Z(26), T(20) becomes S(19). All are exactly -1 shifts, confirming LZS.

Why Other Options Are Wrong:
NBU: implies forward shifting, not backward. KXR: inconsistent or excessive backward shifts. LZT: only two letters match the -1 rule. MZS: keeps M unchanged, breaking the rule.

Common Pitfalls:
Forgetting that A shifts to Z, using +1 instead of -1, or mixing shifts per letter can lead to wrong codes.

Final Answer:
LZS