Answer: 34650
Step-by-step explanation:
The number of permutations of n objects, where one object is repeated [tex]n_1[/tex] times , another is repeated [tex]n_2[/tex] times and so on is :
[tex]\dfrac{n!}{n_1!n_2!....n_k!}[/tex]
Given : The number of letters in string MISSISSIPPI = 11
Here I is repeated 4 times, S is repeated 4 times and P is repeated 2 times.
Then , the number of different strings can be made from the letters in MISSISSIPPI, using all letters is given by :-
[tex]\dfrac{11!}{4!4!2!}=34650[/tex]
Therefore , there are 34650 different strings can be made from the letters in MISSISSIPPI.
