Answer: There are 360360 ways to appoint the members of the cabinet.
Step-by-step explanation:
Since we have given that
Number of eligible candidates = 15
Number of spots available = 5
We need to find the number of different ways the members can be appointed where rank matters
For this we will use "Permutations":
So, the required number of different ways in choosing the members for appointment is given by

Hence, there are 360360 ways to appoint the members of the cabinet.
In this problem you would set these two equations equal to each other.
$8+ $1.50x = $10+ $1x
After this you would simplify the equation to isolate x (being the number of toppings you put on the pizzas)
$8+ 1.50x =$10+ 1x
-8 -8
----------------------------
$1.50x = $2 + $1x
-1x -1x
---------------------------
$.50x/.50 = $2/.50
_______________
x= 4 toppings and the pizzas would equal $14 total
It is 52 because when roundest to the whole number 52 is closest
2a+8a
Add 2 and 8.
2a+8a=10a