Step 1: Understanding the Concept:
Coding-decoding puzzles are based on systematic alphabetic shifts. The goal is to identify the "transformation rule" applied to a known word (plaintext) to turn it into a code (ciphertext). Once this logic is identified, it is applied identically to the target word.
Most common rules involve shifting letters forward or backward by a constant value (\(+1, +2, -1,\) etc.) or using the relative positions of letters in the English alphabet (A=1, B=2, \dots, Z=26).
Step 2: Key Formula or Approach:
Examine the letter shifts for every single character in the reference pair:
\[ \text{Letter}_{\text{Coded}} = \text{Letter}_{\text{Original}} + n \]
Determine the value of \(n\) and apply it to the target word.
Step 3: Detailed Explanation:
Let’s examine the shift spacing inside the reference word pair TABLE \(\rightarrow\) UBCMF:
T \(\xrightarrow{+1}\) U (T is 20th, U is 21st)
A \(\xrightarrow{+1}\) B (A is 1st, B is 2nd)
B \(\xrightarrow{+1}\) C (B is 2nd, C is 3rd)
L \(\xrightarrow{+1}\) M (L is 12th, M is 13th)
E \(\xrightarrow{+1}\) F (E is 5th, F is 6th)
The logical pattern is a uniform \(+1\) progression—every single character is shifted forward by exactly one position in alphabetical order.
Now, we apply this identical \(+1\) shift rule to every character in the target word CHAIR:
C \(\xrightarrow{+1}\) D
H \(\xrightarrow{+1}\) I
A \(\xrightarrow{+1}\) B
I \(\xrightarrow{+1}\) J
R \(\xrightarrow{+1}\) S
Combining these transformed letters gives the coded word DIBJS. This matches option (a) perfectly.
Step 4: Final Answer:
CHAIR will be written as DIBJS in that code language.