Answer:
560 ways
Step-by-step explanation:
Given is a word
referred
We have to find the number of different ways that the letters of"referred" can be arranged
Let us analyse the given word
It contains totally 8 letters
r is repeated 3 times
e is repeated 3 times
f one time and d one time
Using the permutations rule for repeated objects we get
The number of different ways that the letters of"referred" can be arranged
=[tex]\frac{8!}{3!3!} \\=560[/tex]
560 ways
