Answer:
1320 sets
Explanation:
This problem brothers on selection without repetition, so we will be using permutation to solve this problem.
Given
n= 12 ,which is the number we are choosing from
r= 3, which is the number of committee(president, vice-president, and secretary-treasurer.)
![= (n!)/((n-r)!)](https://img.qammunity.org/2021/formulas/mathematics/high-school/ejs6o0bdffv8c6cgn8qsjk2oe0vra8h6tn.png)
Substituting we have
![= (12!)/((12-3)!)\\\\ = (12!)/((9)!)\\\\= (12*11*10*9!)/(9!)](https://img.qammunity.org/2021/formulas/mathematics/high-school/jf3d5oa2hwwu1jhy1z9yj8rew388nshmmp.png)
![= 12*11*10= 1320](https://img.qammunity.org/2021/formulas/mathematics/high-school/msubla05cxhvw4zde5rhsfzigucuvl7g7n.png)