In a certain code language, the word FRIEND is written as FPIBNZ. Using the same pattern of letter transformation, how will the word PATRON be written?

Introduction / Context:
This question deals with a letter coding system where each letter of a word is transformed in a position-dependent way. FRIEND is encoded as FPIBNZ, and we must discover the rule that converts FRIEND to FPIBNZ. Then we have to apply the same rule to PATRON and choose the correct coded form from the options. This tests our ability to compare positions and recognise alternating patterns in alphabet shifts.

Given Data / Assumptions:

• FRIEND becomes FPIBNZ in the secret code.
• The same rule applies to PATRON.
• The length of the word remains the same; only letters change.
• Letter transformations may depend on position (odd or even) in the word.

Concept / Approach:
We inspect FRIEND and FPIBNZ letter by letter. By comparing alphabet positions, we look for a pattern such as no change at some positions and a minus or plus shift at others. Once we know how each position is treated, especially for even and odd positions, we can apply the exact same pattern to PATRON. This positional pattern approach is standard in many coding–decoding questions.

Step-by-Step Solution:
Step 1: Write both words with positions: F(1) R(2) I(3) E(4) N(5) D(6) and F(1) P(2) I(3) B(4) N(5) Z(6). Step 2: Compare letters at each position: 1st position: F -> F (no change). 2nd position: R -> P (R to P is -2 in alphabet positions). 3rd position: I -> I (no change). 4th position: E -> B (E to B is -3). 5th position: N -> N (no change). 6th position: D -> Z (D to Z is -4, wrapping around the alphabet). Step 3: Observe the pattern: odd positions 1, 3 and 5 remain unchanged; even positions 2, 4 and 6 are shifted backward by -2, -3 and -4 respectively. Step 4: Apply this to PATRON (P(1) A(2) T(3) R(4) O(5) N(6)). Keep letters at positions 1, 3 and 5 unchanged: P, T, O. Step 5: Shift letter at position 2 (A) back by 2: A -> Y (since A minus 2 steps wraps around: A -> Z -> Y). Step 6: Shift letter at position 4 (R) back by 3: R -> O. Step 7: Shift letter at position 6 (N) back by 4: N -> J. Step 8: The coded form is P Y T O O J, that is, PYTOOJ.

Verification / Alternative check:
Check each transformed letter: P (unchanged), Y (A minus 2), T (unchanged), O (R minus 3), O (unchanged), J (N minus 4). This mirrors the FRIEND pattern exactly: unchanged, -2, unchanged, -3, unchanged, -4. Hence PYTOOJ must be correct.

Why Other Options Are Wrong:
Option A: PTYOPI changes positions incorrectly and does not follow the alternating rule. Option B: PYTOPJ modifies the last two letters in a way that does not match the -4 shift from N. Option D: PYTPOJ swaps letters 4 and 5, breaking the position mapping. Option E: PTYOJJ alters both the second and last letters beyond the allowed shifts.

Common Pitfalls:
Learners often look for a constant shift (for example, adding the same number to each letter) and miss that the rule changes with position. Another mistake is to forget the wrap-around behaviour when subtracting from letters at the beginning of the alphabet. Writing out alphabet positions explicitly helps to avoid miscalculations and confusion.

Final Answer:
Using the same coding pattern, PATRON is written as PYTOOJ.