There are 11 candidates for three postions at a restaraunt. one postion is for a cook. the second position is for a food server the third position is for a cashier if all 11 candidates are equally qualfied for the theee positions, in how many diflerent ways can the three postions be sted? diferent ways to fil the three posilions there ate 19 pm emer your anwer in the atcwer box cameten netecr desitu la-rie kensington 8 c 5 3 eng pud eter

165 combinations possible

Step-by-step explanation:

This is a combination problem as opposed to a permutation, because the order in which we fill these positions is not important.  We are merely looking for how many ways each of these 11 people can be rearranged and matched up with different candidates, each in a different position each time.  The formula can be filled in as follows:

₁₁C₃ =

which simplifies to

₁₁C₃ =

The factorial of 8 will cancel out in the numerator and the denominator, leaving you with

₁₁C₃ =

which is 165