Using the fundamental counting theorem, it is found that 107,016 different choices are possible.
Fundamental counting theorem:
States that if there are n things, each with [tex]n_1, n_2, …, 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]
In this problem:
Then, applying the theorem:
[tex]N = 7(24)(7)(13)(7) = 107016 [/tex]
107,016 different choices are possible.
A similar problem is given at https://brainly.com/question/19022577