The number of ways the program can be arranged for this segment is 8, 648, 640 ways
It is important to note that the formula for finding the permutation or arrangement of a set of dats is given as;
Permutation = [tex]\frac{n!}{(n-r)!}[/tex]
where
Let's substitute the values into the formula for permutation, we have
Permutation = [tex]\frac{13!}{13 - 7!}[/tex]
Find the difference of the denominator
Permutation = [tex]\frac{13!}{6!}[/tex]
Find the factorial of the values
Permutation = [tex]\frac{6,227,020,800}{720}[/tex]
Divide the numerator by the denominator
Permutation = 8, 648, 640 ways
Thus, the number of ways the program can be arranged for this segment is 8, 648, 640 ways
Learn more about permutation here:
https://brainly.com/question/12468032
#SPJ1