Select the related group of letters from the given alternatives: if MUMBAI is coded as UMBMIA by swapping each pair of letters, how is GURUGRAM coded in the same pattern?

Introduction / Context:
This question is a letter coding and analogy problem. You are told that the word MUMBAI is written as UMBMIA according to a particular rearrangement rule. You must carefully observe that rule and then apply the same pattern to the word GURUGRAM in order to select the correct coded form from the given options. Such questions test your ability to recognise positional patterns and consistent rearrangements in sequences of letters.

Given Data / Assumptions:

• The original word in the example is MUMBAI.
• The coded form of MUMBAI is given as UMBMIA.
• The target word to be coded using the same rule is GURUGRAM.
• We assume that the letters themselves are not changed, only their positions are rearranged.
• Exactly one of the options must follow the same positional pattern that converts MUMBAI to UMBMIA.

Concept / Approach:
The key idea is that MUMBAI and UMBMIA contain the same letters, but arranged in a different order. The easiest way to discover the rule is to split MUMBAI into adjacent pairs of letters and compare each pair before and after coding. If a consistent rule emerges for each pair, we can then take GURUGRAM, split it into similar pairs, and apply the same pairwise transformation. This pair swapping idea is very common in reasoning questions on coding and decoding of words.

Step-by-Step Solution:
Step 1: Write MUMBAI with indices. M(1), U(2), M(3), B(4), A(5), I(6). Step 2: Form adjacent pairs from MUMBAI: MU, MB, AI. Step 3: Look at the coded word UMBMIA and group it into the same sized pairs: UM, BM, IA. Step 4: Observe that each pair has simply been reversed. MU becomes UM, MB becomes BM, and AI becomes IA. Therefore the rule is: take the word two letters at a time and swap the letters in each pair. Step 5: Now apply this rule to GURUGRAM. First write it as pairs: GU, RU, GR, AM. Step 6: Reverse each pair individually. GU becomes UG, RU becomes UR, GR becomes RG, and AM becomes MA. Step 7: Join the reversed pairs together: UG + UR + RG + MA equals UGURRGMA. Step 8: Compare this result with the answer options and identify UGURRGMA as option b.

Verification / Alternative check:
To confirm, check that no letters are lost or duplicated. GURUGRAM has letters G, U, R, U, G, R, A, M. The coded form UGURRGMA uses exactly the same letters, only in a different order, which matches the pair reversing logic. Also verify that if you reverse each pair in UGURRGMA again (UG, UR, RG, MA back to GU, RU, GR, AM), you recover the original word. This two way check confirms that the pattern is correct and consistently applied.

Why Other Options Are Wrong:
RUGUMARG rearranges pairs in a different order and does not come from simply swapping each adjacent pair. UGURGRMA breaks the structure of pairwise reversal and disturbs the grouping. UGRURGAM also does not match the reverse within each pair rule. None of these incorrect options can be produced by the simple and consistent pair swapping transformation used for MUMBAI, so they must be rejected.

Common Pitfalls:
A common mistake is to look for random symmetrical patterns, such as reversing the entire word or moving only the first and last letters, rather than checking simple local operations like swapping pairs. Another pitfall is not grouping the letters correctly and mixing letters from different pairs. Whenever you see a six or eight letter word in such coding questions, always try the pairwise swap pattern first because it often leads to a clean explanation.

Final Answer:
Following the same pair reversing rule used to code MUMBAI as UMBMIA, the word GURUGRAM is coded as UGURRGMA.