Answer:
210 ways
Explanation:
This is a combinatorics problem of the general nature of choosing r elements from a sample of n elements
It is indicated by the term

where n! represents the factorial of n = n x (n-1) x (n-2) x .... 3 x 2 x 1
With n = 10, r = 3 there are C(10, 3) ways of choosing the officers


