If the word FRISKED is coded as HTKUMGF (i.e., each letter is shifted forward by 2 positions in the English alphabet), then how will the word SUN be coded using the same letter-shift rule?

Introduction / Context:
This question tests a basic coding-decoding pattern where each letter of a word is transformed using a consistent alphabet shift. The example FRISKED → HTKUMGF indicates a fixed forward movement in the alphabet for every character.

Given Data / Assumptions:

• FRISKED is coded as HTKUMGF.
• The same rule must be applied to the word SUN.
• Alphabet is cyclic: after Z comes A.

Concept / Approach:
Compare each original letter with its coded letter in the example to detect the shift. If every letter moves by the same number of positions, apply that shift to each letter of the new word.

Step-by-Step Solution:
F → H means shift forward by 2 (F,G,H). R → T is also forward by 2. I → K forward by 2. S → U forward by 2. So, the rule is: shift every letter +2. Now apply to SUN: S → U (+2). U → W (+2). N → P (+2). Therefore, SUN → UWP.

Verification / Alternative check:
If the same +2 shift works consistently across all letters of FRISKED, it is valid to apply it directly to SUN. The transformation remains uniform for each character, confirming UWP.

Why Other Options Are Wrong:
SXO: implies 0 or negative shift from S. VZQ: inconsistent large jumps. TWQ: mixed shifts (S→T is +1, U→W is +2). RVM: shifts backward for S→R.

Common Pitfalls:
Assuming different shifts for different letters, forgetting alphabet wrap-around, or using reverse order instead of shifting are typical mistakes.

Final Answer:
UWP