A business has seven locations to choose from and wishes to rank only the top three locations. How many different ways can this be done?

210

Step-by-step explanation:

Given: total locations = 7

Number of locations wishes to rank = 3

If order of selection matters, then the number of permutations of r things from n=

The number of ways to rank 3 locations out of 7

Hence, the number of different ways required = 210

the answer is 31.27mph

for this case we have by definition, if two lines are perpendicular, then the product of their slopes is -1.

then, given the following line:

so,

we are looking for m_ {2}:

then, the line is given by:

we find "b" replacing the given point:

finally, the equation is:

option c