Program in Python:

Write a function division(n,d) that takes in integers n and d and returns the q and r from the division algorithm.

A.) A function divisors(n) that prints out the divisors of the integer n.

B.) A function FTA(n) that prints out the unique prime number decomposition of the positive integer n (for example, FTA(6) = 2, 3...FTA(12) = 2, 2, 3 )

C.) A function lcm(m,n) that returns the lcm of positive integers m and n.Write a function gcd(m,n) that finds the gcd of m and n using the Euclidean algorithm.

D.) A function bezout(m,n) that finds the gcd of m and n, and then also provides the r and s values discussed in Bezout's lemma.

E.) A function modinv(x,n) that will find the multiplicative inverse of x mod n. Your function should also handle the case that x does not have a unique inverse mod n.