Concept:This is a coding-decoding problem based on a consistent pattern of subtracting fixed numbers from the alphabetical positions of letters.
Explanation:Step 1: Write the alphabetical positions: A=1, B=2, ..., Z=26.
Step 2: Identify the pattern from the given pairs.
For BFKP → XAGK: B(2)→X(24), F(6)→A(1), K(11)→G(7), P(16)→K(11).
Observe:
2−4=−2≡24,
6−5=1,
11−4=7,
16−5=11.
Thus, for odd positions (1st and 3rd) subtract 4; for even positions (2nd and 4th) subtract 5.
Check LLUV → HGQQ: L(12)→H(8) (
12−4), L(12)→G(7) (
12−5), U(21)→Q(17) (
21−4), V(22)→Q(17) (
22−5). The pattern holds.
Step 3: Apply the same logic to ZWIG.
Z(26) is 1st letter (odd):
26−4=22 → V.
W(23) is 2nd letter (even):
23−5=18 → R.
I(9) is 3rd letter (odd):
9−4=5 → E.
G(7) is 4th letter (even):
7−5=2 → B.
Thus, ZWIG becomes VREB.
Answer:Option A: VREB.
