Answer:
There are 24 candidates. Counting rule three states that N objects can be arranged in N! different ways. So, 4 different aces can be arranged in 4! = 24 ways, and each of the 24 candidates can be assigned a unique sequence of aces.
Step-by-step explanation:
this is the sample answer
Answer:
each 24 candidates can be assigned a certain ace
Step-by-step explanation:
i said that