Using the arrangements formula, it is found that there are 24 ways for them to stand in line so that the youngest person is always first, and the oldest person is always last.
<h3>What is the arrangements formula?</h3>
The number of possible arrangements of n elements is given by the factorial of n, that is:

In this problem, we have that there are 6 people. The youngest person(Leslie) has to be first, while the oldest(Parvinis) has to be last, while the remaining 4 can be arranged, hence the number of ways for them to stand in line is given by:

More can be learned about the arrangements formula at brainly.com/question/24648661
#SPJ1
For this case we have to define root properties:
![\sqrt [n] {a ^ n} = a ^ {\frac {n} {n}} = a](https://tex.z-dn.net/?f=%5Csqrt%20%5Bn%5D%20%7Ba%20%5E%20n%7D%20%3D%20a%20%5E%20%7B%5Cfrac%20%7Bn%7D%20%7Bn%7D%7D%20%3D%20a)
In addition, we know that:

On the other hand:

Thus, we can rewrite the given expression as:

ANswer:
Option B
What that person say is the file.