Pure reversal mapping: CEDH : HDEC :: ? : PNRV

Introduction / Context:
This coding analogy uses a simple reversal of letter order. Such items test your precision in handling sequence transformations without introducing unnecessary arithmetic on letters.

Given Data / Assumptions:

• CEDH maps to HDEC.
• We need a word that maps to PNRV under the same transformation.
• Assume the mapping is exactly “reverse the string.”

Concept / Approach:
Since CEDH reversed is HDEC, the rule is reversal. To find ? that maps to PNRV, reverse PNRV to obtain the preimage. Reversal is an involution, so the same operation encodes and decodes.

Step-by-Step Solution:

Verification / Alternative check:
Encode VRNP by reversing → PNRV. This matches perfectly, verifying the solution.

Why Other Options Are Wrong:

• RNPV/NRVP/VNRP: Each is a different permutation that is not the exact reverse of PNRV.

Common Pitfalls:
Attempting letter shifts where none exist, or mis-ordering the reversed letters (e.g., swapping middle pair only). Carefully reverse from last to first.

Final Answer:
VRNP