Answer:
The members of the cabinet can be appointed in 121,080,960 different ways.
Step-by-step explanation:
The rank is important(matters), which means that the order in which the candidates are chosen is important. That is, if we exchange the position of two candidates, it is a new outcome. So we use the permutations formula to solve this quesiton.
Permutations formula:
The number of possible permutations of x elements from a set of n elements is given by the following formula:

If there are 14 eligible candidates for these positions (where rank matters), how many different ways can the members of the cabinet be appointed?
Permutations of 8 from a set of 14. So

The members of the cabinet can be appointed in 121,080,960 different ways.
X= 19/12 which is 1.58 in decimal form
For the table 0.2 would be (1/5) 0.5 would be (1/2). And 0.7 would be (7/10).
For number 2 I would say the denominator changed each time
Answer:
a
Step-by-step explanation:
y= 1/2 ^(x+4)