Using the arrangements formula, it is found that there are 40,320 ways for these swimmers to finish.
The number of possible arrangements of n elements is given by the factorial of n, that is:
[tex]A_n = n![/tex]
In this problem, there are n = 8 swimmers, hence they can finish arranged in 8! ways, that is:
[tex]A_8 = 8! = 40320[/tex]
More can be learned about the arrangements formula at https://brainly.com/question/24648661
