We can use permutation to solve for this problem. Permutation is used to determine the number of arrangements you can do with a given or fixed set. The word TALLAHASSEE has identical letters so we will use this formula:
[tex] \frac{n!}{ n_{1}! n_{2}! n_{3}! ... n_{k}! } [/tex]
where: n is the number of elements in the set
n1 is the number of identical element (object 1)
n2 is the number of identical element (object 2)
n3 is the number of identical element (object 3)
So first let's see how many identical objects there are and the number of each.
A = 3 L= 2 S = 2 E= 2
How many elements in the set? 11
Now input your given:
[tex] \frac{11!}{3! 2! 2! 2!} [/tex]
[tex] \frac{39,916,800}{48} [/tex]
= 831,600 arrangements
