<span>f(x) = ax2+bx+c, is quadratic equation
</span><span>function opening downward if the a<0,
</span><span>kf(x) = -x², a= -1<0
so the answer is </span><span>B.kf(x) </span><span>
</span>
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.
The answer is 30, can I get the brainliest answer