Answer:
2730 ways
Step-by-step explanation:
Given that,
There are 15 eligible candidates for these positions.
The newly elected president needs to decide the remaining 3 spots available in the cabinet he/she is appointing.
It is a concept based on permutations.
Put n = 15 and r = 3
Hence, 2730 ways can the members of the cabinet be appointed
So firstly, you want to foil - (7v^4 + 6) [Think of the minus sign as -1]:
Next, combine like terms and your answer will be:
6
y=3