tbm queria saber essa pergunta
Answer: 153
Step-by-step explanation:
When we have a group of N elements, the total number of combinations of K elements ( K ≤ N) is:

Where N! = N*(N - 1)*(N - 2)*...*2*1
In this case, we have a group of 18 people (then N = 18) and we want to see how many different combinations of 2 we can make (K = 2).
Using the above equation we get:

There are 153 different ways in which the manager can do this.
Answer:
Every ordered pair within this region will satisfy the inequality y ≥ x. Incorrect. The boundary line here is y = x, and the correct region is shaded, but remember that a dotted line is used for < and >. The inequality you are graphing is y ≥ x, so the boundary line should be solid.
Answer:
it is the first one
Step-by-step explanation:
if right give brainliest