In a certain coding language used in verbal reasoning tests, the word CHAMPION is written as HCMAIPNO by swapping every pair of adjacent letters. Using the same letter–pair swapping pattern, how will the word NEGATIVE be coded in that language?

Introduction / Context:
This multiple-choice question tests your ability to recognize and apply a simple but slightly tricky letter-coding pattern. The example code for the word CHAMPION is given, and you must deduce the rule and then apply it to a different word, NEGATIVE. Such pattern-recognition questions are very common in bank exams, SSC, and other competitive verbal reasoning sections, so understanding the logic step-by-step is useful for many similar problems.

Given Data / Assumptions:

• Original word: CHAMPION.
• Coded form: HCMAIPNO.
• Target word: NEGATIVE.
• We assume the code pattern is consistent for all words.
• We assume no letter is removed or added, only rearranged.

Concept / Approach:
The safest way to handle such coding questions is to compare positions very carefully. Count the positions of each letter in the original word and in the coded word. If the number of letters is the same and all letters appear exactly once, it is usually a rearrangement rule. Here, we compare CH to HC, AM to MA, PI to IP, and ON to NO. This suggests that every pair of adjacent letters in the original word is simply swapped in position. Once the pattern is confirmed, we apply the exact same pairwise swapping logic to the new word NEGATIVE to obtain its code. The key concept is pairwise transposition of letters: (1,2), (3,4), (5,6), (7,8).

Step-by-Step Solution:
Step 1: Write CHAMPION with positions: C(1), H(2), A(3), M(4), P(5), I(6), O(7), N(8). Step 2: Compare with HCMAIPNO = H(1), C(2), M(3), A(4), I(5), P(6), N(7), O(8). Step 3: Observe: positions (1,2) are swapped: C,H → H,C. Positions (3,4) are swapped: A,M → M,A. Positions (5,6) are swapped: P,I → I,P. Positions (7,8) are swapped: O,N → N,O. Step 4: Conclude the rule: swap every adjacent pair of letters (1↔2, 3↔4, 5↔6, 7↔8). Step 5: Now apply the same rule to NEGATIVE. Write its letters with positions: N(1), E(2), G(3), A(4), T(5), I(6), V(7), E(8). Step 6: Swap positions (1,2): N,E → E,N giving EN. Step 7: Swap positions (3,4): G,A → A,G giving AG. Step 8: Swap positions (5,6): T,I → I,T giving IT. Step 9: Swap positions (7,8): V,E → E,V giving EV. Step 10: Combine all swapped pairs: EN + AG + IT + EV = ENAGITEV.

Verification / Alternative check:
As an additional check, you can reverse the process. Take the coded word ENAGITEV and group letters into pairs: EN, AG, IT, EV. Swap each pair back: NE, GA, TI, VE. When you join them, you get NEGATIVE again. This reconfirms that the pairwise swap rule is symmetric and correctly applied. Similarly, applying the same back-swapping to HCMAIPNO restores CHAMPION, which further validates that we have decoded the pattern accurately and not by coincidence. Whenever you can run the coding rule in both directions and consistently get original words, the rule is almost certainly correct.

Why Other Options Are Wrong:
Option A (NEAGVEIT) rearranges letters in a way that does not follow strict pairwise swapping; the pairs are not simply reversed from the original positions. Option C (MGAETVIE) changes the relative positions of several letters and does not respect the 1↔2, 3↔4, 5↔6, 7↔8 structure. Option D (EGAITEVN) again breaks the simple adjacent swap pattern and mixes letters from different pairs. Option E (NAGEVITE) also fails when you attempt to swap back in pairs; it cannot reconstruct NEGATIVE. Therefore, these options do not follow the discovered rule.

Common Pitfalls:
A common mistake is to look for arithmetic shifts in alphabetical positions (for example, +1 or -1) instead of checking for mere rearrangement. Another mistake is to misgroup letters (such as trying to swap triples instead of pairs) or to misread the example word. Candidates sometimes skip writing positions, which makes it easy to miss the simple 2-letter block swapping. In coding-decoding questions, always check whether the pattern is a substitution, a rearrangement, or a combination of both. Here, it is purely a rearrangement, which makes the question easier once you notice the pattern.

Final Answer:
Therefore, according to the same coding rule, the word NEGATIVE will be written as ENAGITEV in that language.