In a certain code language, the word RINKS is written as SKOMT. Using the same letter shift pattern, how is the word FRIED written in that language?

Introduction / Context:
This question involves a positional pattern where different letters of the word are shifted by different amounts. The example RINKS becomes SKOMT. We must decode the transformation by examining each letter pair and then apply the same alternating shifts to the new word FRIED. The task combines knowledge of alphabet positions with the ability to recognise repeating patterns across positions in a word.

Given Data / Assumptions:

• Original example: RINKS is coded as SKOMT.
• Target word: FRIED.
• The coding rule depends on the position of each letter in the word.
• Alphabet positions A to Z are considered from 1 to 26.
• The same pattern of shifts is applied consistently to any five letter word.

Concept / Approach:
We begin by converting each letter of RINKS and SKOMT into their alphabetic positions and computing the differences. For the first letter, R becomes S, which is a forward shift of one. I becomes K, which is a forward shift of two. N becomes O, a forward shift of one. K becomes M, a forward shift of two. S becomes T, another forward shift of one. So the pattern is an alternating sequence of plus one, plus two, plus one, plus two, plus one across the five positions. We then apply exactly this alternation to FRIED: position one plus one, position two plus two, position three plus one, and so on.

Step-by-Step Solution:
Step 1: Convert RINKS to positions: R(18), I(9), N(14), K(11), S(19).Step 2: Convert SKOMT to positions: S(19), K(11), O(15), M(13), T(20).Step 3: Compute differences: 18 to 19 is plus one, 9 to 11 is plus two, 14 to 15 is plus one, 11 to 13 is plus two, and 19 to 20 is plus one. The pattern is +1, +2, +1, +2, +1.Step 4: Write FRIED and note positions: F(6), R(18), I(9), E(5), D(4).Step 5: Apply the pattern. Position one: F plus one becomes G. Position two: R plus two becomes T. Position three: I plus one becomes J. Position four: E plus two becomes G. Position five: D plus one becomes E.Step 6: Combine the coded letters to obtain GTJGE.

Verification / Alternative check:
To verify, we can reverse the process on GTJGE using minus one, minus two, minus one, minus two, minus one. Starting from G, T, J, G, E and applying the opposite shifts we get back F, R, I, E, D, which confirms that GTJGE is correctly derived from FRIED under the same pattern. Likewise, reversing the pattern on SKOMT reconstructs RINKS, so the transformation is self consistent and the answer is reliable.

Why Other Options Are Wrong:
The options PQGHJ, HUKHD, and KOTGJ show different shift magnitudes that do not match the alternating plus one and plus two pattern when checked letter by letter. For instance, if the second letter of FRIED, R, does not become T under the candidate code, that option is immediately inconsistent. The distractor GSJGF also uses letters from near the same region of the alphabet but fails to follow the precise alternation, so it does not reconstruct FRIED under the reverse shift rule. Only GTJGE obeys the exact coded sequence at all positions.

Common Pitfalls:
Many candidates wrongly assume a constant shift across all letters, such as plus two throughout, which would not match the example. Another typical mistake is to miscalculate a single alphabetic step, for instance counting E to H as two steps instead of three. Keeping a written list of alphabet positions and marking each forward shift explicitly helps prevent these off by one errors and ensures the alternating pattern is captured correctly.

Final Answer:
Using the same alternating shifts of plus one and plus two applied to RINKS, the coded form of FRIED is GTJGE.