Answer:
11,880 different ways.
Step-by-step explanation:
We have been given that from a pool of 12 candidates, the offices of president, vice-president, secretary, and treasurer will be filled. We are asked to find the number of ways in which the offices can be filled.
We will use permutations for solve our given problem.
, where,
n = Number of total items,
r = Items being chosen at a time.
For our given scenario
and
.





Therefore, offices can be filled in 11,880 different ways.
Answer:
C
Step-by-step explanation:
so the first one ends at 4.7107
the second- 3.3568
the third- 5.1401
and multiplying the first by 5000 we get- 23,553.5
for the second we get -6,713.6
for the third we get 41,120
adding them all together we get 71,387.1
and so C is the closest
Answer:
Sorry I could only find the answer to the second part.
y=56x