Digit–letter code mapping: If 1 8 5 1 4 encodes the word AHEAD (1→A, 8→H, 5→E, 1→A, 4→D), then what word is represented by 3 1 3 8 5?

Introduction / Context:
Coding–decoding questions map digits to letters (or vice versa). You must infer the mapping from a given example and apply it to decode another sequence. Here, “AHEAD” is encoded as 1 8 5 1 4, which directly reveals several digit→letter assignments.

Given Data / Assumptions:

• From AHEAD → 1 8 5 1 4 we infer: 1→A, 8→H, 5→E, 4→D.
• We need to decode 3 1 3 8 5.
• Digit 3 must map consistently to the same letter in both positions it appears.

Concept / Approach:
Apply known mappings first: 1→A, 8→H, 5→E. Thus 3 1 3 8 5 becomes ? A ? H E. Among the options, the only reasonable, consistent completion is “CACHE,” which corresponds to C A C H E. Therefore, 3 must map to C (3→C). This yields a coherent, letter-perfect decoding that matches one of the choices exactly.

Step-by-Step Solution:
1) Write 3 1 3 8 5 as _ A _ H E using known mappings.2) Compare to options; “CACHE” fits the pattern.3) Deduce 3→C, completing the mapping.

Verification / Alternative check:
No other option matches the partial mapping (_ A _ H E) with consistent identical letters in slots 1 and 3. Hence “CACHE” is uniquely determined.

Why Other Options Are Wrong:
They either violate the repeated-letter constraint (positions 1 and 3 must be the same letter) or clash with established 1→A, 8→H, 5→E.

Common Pitfalls:
Assuming a positional/shift cipher; here it is a direct digit→letter substitution.

Final Answer:
CACHE