If in a certain language, TREE is coded as USFF, how will MANGO be coded in that language?

Options

A. BHONC
B. OPHNB
C. NOPHB
D. NBOHP

Answer

To solve the problem of how the word "MANGO" is coded in the same way that "TREE" is coded as "USFF," we need to analyze the coding pattern used in the first example.

### Step-by-Step Solution:

1. **Identify the pattern in the coding of "TREE" to "USFF":**
- T → U: Move one step forward in the alphabet (T is the 20th letter, U is the 21st).
- R → S: Move one step forward (R is the 18th letter, S is the 19th).
- E → F: Move one step forward (E is the 5th letter, F is the 6th).
- E → F: Again, move one step forward (same as above).

2. **Apply the same pattern to the word "MANGO":**
- M → N: Move one step forward (M is the 13th letter, N is the 14th).
- A → B: Move one step forward (A is the 1st letter, B is the 2nd).
- N → O: Move one step forward (N is the 14th letter, O is the 15th).
- G → H: Move one step forward (G is the 7th letter, H is the 8th).
- O → P: Move one step forward (O is the 15th letter, P is the 16th).

3. **Combine the coded letters:**
- After applying the coding pattern, we get:
- M → N
- A → B
- N → O
- G → H
- O → P
- Therefore, "MANGO" is coded as "NBOHP".

4. **Final Answer:**
- The coded form of "MANGO" is **NBOHP**.