If all the letters of the word ACADEMICIAN are permuted in all possible ways then the number of permutations in which no two A's are together and all the consonants are together is
Show Hint
For "objects not together" problems, use the gap method. First, arrange the objects that do not have restrictions. This creates gaps (including at the ends) where the restricted objects can be placed.