Find the alphabetical order which can replace ‘?’ in the given analogy G3S :…

In this letter-number-letter analogy, the digit sitting between the two letters is a fixed shift value that carries over unchanged from one term to the next. The first letter of the resulting term is obtained by moving forward in the alphabet by that many positions, and the last letter is obtained by moving backward by the same number of positions.

1. In the given pair G3S : J3P, the shift value is 3. G (7th letter) + 3 = J (10th letter), confirming the forward shift on the first letter.

2. S (19th letter) − 3 = P (16th letter), confirming the backward shift on the last letter, while the digit 3 stays unchanged.

3. Apply the identical rule to L4X, where the shift value is 4. L (12th letter) + 4 = P (16th letter) for the first letter.

4. X (24th letter) − 4 = T (20th letter) for the last letter, with the digit 4 unchanged.

5. Combining the results gives the term P4T.

Reversing the check confirms the pattern holds: P − 4 returns L, and T + 4 returns X, matching the original letters, so P4T is consistent with the established rule.