Answer:
The number of distinguishable arrangements are 1,663,200.
Step-by-step explanation:
The word is: CONNECTICUT
The number of ways to arrange a word when no conditions are applied is:

Here <em>k</em> is the number of times a word is repeated.
In the word CONNECTICUT there are:
3 Cs
2 Ns
2 Ts
And there are a total of <em>n</em> = 11 letters
So, the number of distinguishable arrangements are:


Thus, the number of distinguishable arrangements are 1,663,200.
Answer:
$7.10
Step-by-step explanation:
0.71 x 10= 7.10
Answer:
D is my guess or B
Step-by-step explanation:
Answer:
4√5
Step-by-step explanation:
The length=√(3--1)²+(-3-5)²
l=√(4)²+(-8)²
l=√16+64
l=√80=4√5