The question asks us to find the coded representation of the word 'UNCLE' based on the given examples: 'FATHER' coded as 'IFWMHW' and 'SISTER' coded as 'VNVYHW'.
We need to identify the relationship between the letters of the original words and their corresponding coded letters.
The pattern observed is a sequential addition of 3 and 5 letters to the original letters: +3, +5, +3, +5, and so on.
Now, we apply the same +3, +5 pattern to the word 'UNCLE':
Therefore, 'UNCLE' is coded as 'XSFQH'.
In a certain code language, 'INERTIA' is written as 'RGVKGBZ'. How will 'FLOWER' be written in that language?
In a certain code language, ‘ADVANCE’ is written as ‘VDAAECN’ and ‘BABYSIT’ is written as ‘BABYTIS’. How will ‘AFFABLE’ be written in that language?
In a certain language, CHHAPAK is coded as DJKEUGR. How will MALANGA be coded in that language?
In a certain code language, ‘DURABLES’ is written as ‘BSVETFMC’. How will ‘FEASIBLE’ be written in that language?
In a certain code language, 'FIXED' is written as 'XIFED' and 'MOUSE' is written as 'USOME'. How will 'GAMBIT' be written in that language?