Good evening ,
Answer:
We just transform the g graph using a translation of vector (-i)
Step-by-step explanation:
Look at the photo below for the graphs.
:)
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.
compare the divisor x-3 with x-a which will give a=3 and then use remainder theorem.
Step-by-step explanation:
y=6+4x, as equation (iii)
=> -5x-(6+4x)=21
=> -5x-6-4x=21
=> -5x-4x-6=21
=> -9x-6=21
=> -9x=21+6
=> -9x=27
x= -3, by dividing both sides by -9
So, by inserting x in the first equation,
=> -4(-3)+y=6
=> 12+y=6
=> y=6-12
=> y= -6.
Therefore, x= -3 and y= -6
Z = (x - m)/s
z = (38-40)/8
z = -2/8
z = -1/4
z = -0.25
The z score is -0.25