If in the given word “ CONVERSION”, if we replaced all odd position letter (from left) with its just next letter and replace all the even position letter (from left) with its just previous letter then find how many letters are repeated there in the new arrangement?

The correct option is None.

Let's break down the step-by-step process to transform the word CONVERSION based on the given rules.

Step 1: Identify the positions of each letter in the word "CONVERSION" (from left to right).

1^st letter (Odd): C
2^nd letter (Even): O
3^rd letter (Odd): N
4^th letter (Even): V
5^th letter (Odd): E
6^th letter (Even): R
7^th letter (Odd): S
8^th letter (Even): I
9^th letter (Odd): O
10^th letter (Even): N

Step 2: Apply the transformation rules:

- For odd-positioned letters: Replace with their just next letter in the alphabetical order (+1 position).
- For even-positioned letters: Replace with their just previous letter in the alphabetical order (-1 position).

Let's perform the operations for each letter:

1. C (1^st, Odd) → C + 1 = D
2. O (2^nd, Even) → O - 1 = N
3. N (3^rd, Odd) → N + 1 = O
4. V (4^th, Even) → V - 1 = U
5. E (5^th, Odd) → E + 1 = F
6. R (6^th, Even) → R - 1 = Q
7. S (7^th, Odd) → S + 1 = T
8. I (8^th, Even) → I - 1 = H
9. O (9^th, Odd) → O + 1 = P
10. N (10^th, Even) → N - 1 = M

Step 3: Write down the new word arrangement.

The new word formed is D N O U F Q T H P M.

Step 4: Count the repeated letters in the new arrangement.

Letters present in the new word: D, N, O, U, F, Q, T, H, P, M.
All 10 letters are unique, and none of the letters repeat in this new arrangement.

Hence, the number of repeated letters is None (0).