Thank you for reporting, we will resolve it shortly
Q.
The number of permutations that can be formed by arranging all the letters of word NINETEEN in which no two $E's$ occur together is
Permutations and Combinations
Solution:
First place $N, I, N, T, N$ at cross places
$X.X.X.X.X.$
Then place $E’s$ at dot places. In that case, no two $E’s$ will be together.
$\therefore $ total no. of ways $=\frac{5\, !}{3\,!}\cdot \,{}^{6}C_{3}$
[$\because$ no. of $N’s = 3$ out of $5 \,N, I, N, T, N$]