Respuesta :
Using the Fundamental Counting Theorem, it is found that there are 27,600 ways for the letters to be arranged.
What is the Fundamental Counting Theorem?
It is a theorem that states that if there are n things, each with [tex]n_1, n_2, \cdots, n_n[/tex] ways to be done, each thing independent of the other, the number of ways they can be done is:
[tex]N = n_1 \times n_2 \times \cdots \times n_n[/tex]
For this problem, considering that the first letter can only be 2 of them and the letters cannot repeat, the parameters are given as follows:
[tex]n_1 = 2, n_2 = 25, n_3 = 24, n_4 = 23[/tex]
Hence the number of ways that the letters can be arranged is given by:
N = 2 x 25 x 24 x 23 = 27,600.
More can be learned about the Fundamental Counting Theorem at https://brainly.com/question/24314866
#SPJ1
