Answer:
There are 151,200 different ways.
Step-by-step explanation:
For solving this question, we need the concept of permutation, the permutation gives as the number of ordered arrangement that can be made chosen k elements from a group of n elements. it is calculated as:
[tex]\frac{n!}{(n-k)!}[/tex]
So, in this case, we need to find the number of ways in which 6 top participants from the 10 participants can cross the finish line.
Now, we can replace n by 10 and k by 6 and calculate the number of permutations as:
[tex]\frac{10!}{(10-6)!}=151,200[/tex]
Finally, there are 151,200 different ways in which the top 6 cars can cross the finish line.
