In a certain code language “NOMINATION” is written as “PMOGPYVGMP”. What will…

Concept: In a letter-substitution code, first uncover the rule by comparing the coded word with the original one letter at a time, then apply that same rule to the target word. The shift can depend on the type of letter (consonant or vowel), not on its position in the word.

Finding the rule from NOMINATION → PMOGPYVGMP (each letter maps in place):

1. Every consonant moves two places forward: N→P, M→O, N→P, T→V, N→P.

2. Every vowel moves two places back: O→M, I→G, I→G, A→Y, O→M.

3. So the rule is: consonant +2, vowel −2 (wrapping A→Y).

Applying the rule to CATALOG, letter by letter in its own position:

1. C (consonant) +2 → E

2. A (vowel) −2 → Y

3. T (consonant) +2 → V

4. A (vowel) −2 → Y

5. L (consonant) +2 → N

6. O (vowel) −2 → M

7. G (consonant) +2 → I

Cross-check: a naive “odd position +2, even position −2” rule fails NOMINATION at its last two letters (it would give Q and L instead of the actual M and P). Only the consonant/vowel rule fits all ten letters, and it gives the code EYVYNMI.