`{:(A , B , C , D , E , F , G , H , I , J , K , L , M , N , O , P , Q , R ,S , T ,U , V , W ,X , Y , Z), (1 ,2 , 3 , 4 ,5, 6 , 7,8,9,10 , 11 , 12, 13, 14, 15 , 16 , 17 , 18 , 19, 20 , 21 ,22 , 23 , 24 , 25 , 26):}`
MUMBAI: LTLAZH :: DELHI : ?

Options

A. CDKGG
B. IHLED
C. CDKGH
D. BCKGH

Explanation

To solve the analogy question, we need to determine the code for the word "DELHI" based on the pattern established by the word "MUMBAI" and its corresponding code "LTLAZH".

### Step-by-Step Solution:

1. **Identify the Pattern**:
- The first pair is "MUMBAI" and "LTLAZH". We need to analyze how each letter in "MUMBAI" corresponds to the letters in "LTLAZH".

2. **Mapping the Letters**:
- Let's break down the letters:
- M → L (M to L is one letter backward)
- U → T (U to T is one letter backward)
- M → L (M to L is one letter backward)
- B → A (B to A is one letter backward)
- A → Z (A to Z is one letter backward)
- I → H (I to H is one letter backward)

3. **Establish the Rule**:
- The rule we have established is that each letter in the word is replaced by the letter that comes one position before it in the alphabet.

4. **Apply the Rule to "DELHI"**:
- Now, we will apply the same rule to the word "DELHI":
- D → C (D to C is one letter backward)
- E → D (E to D is one letter backward)
- L → K (L to K is one letter backward)
- H → G (H to G is one letter backward)
- I → H (I to H is one letter backward)

5. **Combine the Results**:
- After applying the rule, we get:
- D → C
- E → D
- L → K
- H → G
- I → H
- Therefore, the code for "DELHI" is "CDKGH".

### Final Answer:
The code for "DELHI" is **CDKGH**.

---