How many different strings can be made from the letters in mississippi, using all the letters and having no consecutive s's?

Here is the answer to the given question above.
Since there are 1 "M", 4 "I"s, 4 "S"s, 2 "P"s : totally 11 letters, we can get the final 11! / ( 1! * 4! * 4! * 2! ) = 34650
Therefore, the answer would be 34650 different strings can be made from the letters of MISSISSIPPI, using all the letters having no consecutive S's. Hope this answer helps. 

Fgfbekbkdbe i appreciate it very much