If in some unknown language JUNGLE is written as QFMTOV, then OSTRICH will be…

Concept: Many coding-decoding questions use a fixed letter-position substitution cipher, where each letter is replaced by another letter found from a rule discoverable in the given example — here, a mirror rule where a letter at alphabet position p is replaced by the letter at position (27 − p), so A↔Z, B↔Y, C↔X, and so on symmetrically about the middle of the alphabet.

Confirming the rule: J is the 10th letter, and 27 − 10 = 17, which is Q; E is the 5th letter, and 27 − 5 = 22, which is V. Checking all six letters this way reproduces JUNGLE → QFMTOV exactly, confirming the position-27 rule.

Applying the rule to OSTRICH:

1. O is the 15th letter: 27 − 15 = 12, which is L.

2. S is the 19th letter: 27 − 19 = 8, which is H.

3. T is the 20th letter: 27 − 20 = 7, which is G.

4. R is the 18th letter: 27 − 18 = 9, which is I.

5. I is the 9th letter: 27 − 9 = 18, which is R.

6. C is the 3rd letter: 27 − 3 = 24, which is X.

7. H is the 8th letter: 27 − 8 = 19, which is S.

Cross-check: The rule is self-inverse, since 27 − (27 − p) = p. Decoding the first letter of the result, L (12th letter), gives 27 − 12 = 15, which is O — the original first letter of OSTRICH. This confirms the mapping is consistent in both directions.

Result: Encoding every letter of OSTRICH in order gives L, H, G, I, R, X, S, so OSTRICH is written as LHGIRXS.