Answer:
The officers can be chosen in 1320 ways.
Step-by-step explanation:
The order in which the officers are chosen is important(the first is president, second vice president and third secretary) which means that the permutations formula is used to solve this question.
Permutations formula:
The number of possible permutations of x elements from a set of n elements is given by the following formula:
[tex]P_{(n,x)} = \frac{n!}{(n-x)!}[/tex]
In this question:
3 officers from a set of 12. So
[tex]P_{(12,9)} = \frac{12!}{9!} = 1320[/tex]
The officers can be chosen in 1320 ways.
