A permutation is a (possible) rearrangement of objects. For example, there are 6 permutation of rearranging letters a, b, c: abc, acb, bac, bca, cab, cba. a b c , a c b , b a c , b c a , c a b , c b a .
Calculate the number of "CLOSENESS" word that can be obtained by rearranging the letters.
There will be factorial ($n!$) no of ways if there are \(n\) number of letters .
The answer is 9!/(2!.3!)=(9.8.7.6.5.4.3.2.1)/(2.1.3.2.1)
