The number of permutations of the characters in LILAC so that no character appears in its original position, if the two L’s are indistinguishable, is ________ .
Note – This question was Numerical Type.
Explanation: There are 3 choices for the first slot, and then 2 for the third slot. That leaves one letter out of I,A,C unchosen and there are 2 slots that one might occupy. After that, the L′s must go in the 2 unfilled slots.
Hence the answer is,
3×2×1×2 = 12
Option (A) is correct.
Quiz of this Question