In a certain code, the word "SOBER" is written by shifting every letter one position backward in the alphabet (S->R, O->N, B->A, E->D, R->Q). Using the same rule, how will "LOTUS" be written?

Introduction / Context:
This problem belongs to the basic coding–decoding family where each letter of a word is transformed using a consistent substitution rule. Recognizing a uniform shift across all letters is a common exam pattern in verbal reasoning.

Given Data / Assumptions:

• "SOBER" is written as a coded word by shifting letters backward by 1 place in the alphabet.
• We must apply the same letter shift to "LOTUS".
• Alphabet order assumed: A B C ... X Y Z; after A backward wraps to Z if needed.

Concept / Approach:
The rule is: for each letter, replace it with the previous alphabet letter. Example: B becomes A, C becomes B, and so on. This is a Caesar shift of -1 applied uniformly to all positions.

Step-by-Step Solution:
L -> KO -> NT -> SU -> TS -> RTherefore "LOTUS" becomes "KNSTR".

Verification / Alternative check:
Apply the same -1 shift to "SOBER": S->R, O->N, B->A, E->D, R->Q. The stated example demonstrates the very rule; our application to "LOTUS" is consistent.

Why Other Options Are Wrong:

• MPUWT: mixes +1 changes; does not follow uniform -1.
• KMSTR: the second letter M implies -1 from N, not from O; inconsistent rule.
• LMRST: leaves first letter unchanged; not a -1 shift for all positions.
• None of these: invalid because KNSTR is valid and present.

Common Pitfalls:
Candidates sometimes shift only vowels or only consonants, or shift forward instead of backward. Another error is applying different shifts to different positions.

Final Answer:
KNSTR