In a certain code language, the word TRAIN is written as NIART by reversing the order of its letters. Using the same reversal rule, how is the word SCOOTER written in that code language?

Introduction / Context:
This is a straightforward coding question where each word is transformed by reversing the order of its letters. The example given is TRAIN written as NIART. We need to apply exactly the same reversal pattern to the word SCOOTER.

Given Data / Assumptions:

• TRAIN → NIART.
• We must encode SCOOTER.
• No other changes (like shifting letters) are applied; just reversal of order.

Concept / Approach:
If TRAIN becomes NIART, the last letter T becomes first, the second last N becomes second, and so on. The mapping is a simple reverse: position 1 swaps with last, position 2 swaps with second last, etc. We apply this directly to SCOOTER.

Step-by-Step Solution:
Step 1: Write SCOOTER clearly with its letters in order. S C O O T E R. Step 2: Reverse the order of letters. Original order: S (1), C (2), O (3), O (4), T (5), E (6), R (7). Reversed order: R (7), E (6), T (5), O (4), O (3), C (2), S (1). Step 3: The reversed sequence spells RETOOCS.

Verification / Alternative check:
We can quickly test this approach again with TRAIN. Writing TRAIN as T R A I N and reversing gives N I A R T, which matches NIART exactly. This confirms that the coding rule is indeed plain reversal.

Why Other Options Are Wrong:
The other options alter the internal order of the letters without performing a full reversal. For example, RETOCSO or RETSCOO shuffle letters incorrectly and do not correspond to a simple mirror image of SCOOTER.

Common Pitfalls:
The main mistake is misordering letters while reversing, especially when there are repeated letters like the two O characters in SCOOTER. Writing the letters in positions and then reversing systematically helps avoid such errors.

Final Answer:
By reversing the letters, SCOOTER is written as RETOOCS in that code language.