Please solve using python programming. Thanks.

6. Prime Factors The following recursive function returns the prime factors of the number n. Explain how the function works tt Returrlist containirg the princ factors f sctutn n while b while not e b 7. Alphabetical Order The following iterative function determines whether a list of lowercase words is in alphabetical order. Write the equivalent recursive function # Datarnane whathar Is.ct of lovorcs.c. words is r, alphabetical ordar. rotuer Tr 8. Sequence of Numbers The following iterative function displays a sequence of numbers. Write the equivalent recursive function. ## Dazplay the rarbe12 tron to n, wit are while print (a) 9. Subsets The number of subsets of r elements that can be selected from a set of n elements is written as C(n, r). The value of C (n, r) is also the coemicient of in the binomial expansion of (z +1) Ir 0or r = n, then the value orc n, r is 1 Otherwise. C n, r expansion of (z t 1)n. See Fig. 6.23 C n 1 r-1 + C(n 1 write a program using a recursive ru ction that allows n to be input by the user and displays the coemcients in the r Enter a positive integer: 1 5 10 10 31 FIGURE 6.23 Possible outcome of Exercise 9 6. Prime Factors The following recursive function returns the prime factors of the number n. Explain how the function works tt Returrlist containirg the princ factors f sctutn n while b while not e b 7. Alphabetical Order The following iterative function determines whether a list of lowercase words is in alphabetical order. Write the equivalent recursive function # Datarnane whathar Is.ct of lovorcs.c. words is r, alphabetical ordar. rotuer Tr 8. Sequence of Numbers The following iterative function displays a sequence of numbers. Write the equivalent recursive function. ## Dazplay the rarbe12 tron to n, wit are while print (a) 9. Subsets The number of subsets of r elements that can be selected from a set of n elements is written as C(n, r). The value of C (n, r) is also the coemicient of in the binomial expansion of (z +1) Ir 0or r = n, then the value orc n, r is 1 Otherwise. C n, r expansion of (z t 1)n. See Fig. 6.23 C n 1 r-1 + C(n 1 write a program using a recursive ru ction that allows n to be input by the user and displays the coemcients in the r Enter a positive integer: 1 5 10 10 31 FIGURE 6.23 Possible outcome of Exercise 9