If in a certain code language 'JOSEPH' is written as 'FKOALD', then how will…

In a letter-coding question, the coded word is produced by applying the SAME transformation to every letter of the plaintext -- most commonly a fixed cyclic shift along the alphabet (a Caesar-style shift by a constant number of places, forward or backward), with letter order preserved. To find the rule, compare the given plaintext-code pair letter by letter to identify the constant shift, then apply that identical shift to every letter of the new word in the same order.

1. Write 'JOSEPH' against its code 'FKOALD' letter by letter: J-F, O-K, S-O, E-A, P-L, H-D.

2. Find the shift for each pair (difference in alphabet position): J(10)->F(6) is -4; O(15)->K(11) is -4; S(19)->O(15) is -4; E(5)->A(1) is -4; P(16)->L(12) is -4; H(8)->D(4) is -4. All six positions give the same shift, -4, confirming a uniform rule.

3. Apply the same -4 shift to each letter of 'GEORGE' in order: G(7)->C(3), E(5)->A(1), O(15)->K(11), R(18)->N(14), G(7)->C(3), E(5)->A(1).

4. Read the shifted letters in order: C, A, K, N, C, A.

Cross-check by reversing the shift: applying +4 to 'CAKNCA' gives C->G, A->E, K->O, N->R, C->G, A->E, which reconstructs 'GEORGE' exactly -- confirming the derivation.

So 'GEORGE' is coded as 'CAKNCA'.