Answer:
The manager can select a team in 61425 ways.
Step-by-step explanation:
The order in which the cashiers and the kitchen crews are selected is not important. So we use the combinations formula to solve this question.
Combinations formula:
is the number of different combinations of x objects from a set of n elements, given by the following formula.
In how many ways can the manager select a team?
2 cashiers from a set of 10.
4 kitchen crews from a set of 15. So
The manager can select a team in 61425 ways.
8/12 in simplest form is 2/3.
Andrew can reach a maximum of 
high up the wall.
The right-angled triangle formed can be solved using the 
ratio. that is
where 
is the distance from the foot of the wall to the tip of the ladder where it rests on the wall. Substituting, and solving for , we get
Since Andrew can reach an extra 
above the point where the ladder rests against the wall, the maximum height Andrew can paint is
Another solved word problem on trigonometry can be found here: brainly.com/question/12146092
Answer:
1) x < 1, x > 9
2) 2 < x ≤ 6, -4 ≤ x < 0
Step-by-step explanation:
1) lx - 5l > 4
x - 5 = 4
x = 9
-(x - 5) = 4
x = -4 + 5 = 1
x < 1, x > 9
3) 1 < lx-1l ≤ 5
1 < x-1 ≤ 5
2 < x ≤ 6
1 < -(x-1) ≤ 5
-5 ≤ x-1 < -1
-4 ≤ x < 0
