If a × b = n, we call a × b a factorization of n. In this exercise, write a program that takes a positive integer n from input, and then outputs all factorizations of n; you should follow the formatting given by the following example for n=10.

def factor(n):
  if n == 1:
    return 1
  else:
    return n * factor(n - 1)

print(factor(10))

A:

You can use recursion to solve this problem. The idea is to keep dividing the number by 2 until it is 1. Then you multiply the number by the number of times you divided it by 2. For example, if you