input: Write a python function to perform prime factorization of a given number and return the list of prime factors.
  assert prime_factorization(56) == [2, 2, 2, 7]
  assert prime_factorization(97) == [97]
  assert prime_factorization(100) == [2, 2, 5, 5]
output: def prime_factorization(n):
      factors = []
      divisor = 2
      while n >= 2:
          while n % divisor == 0:
              factors.append(divisor)
              n //= divisor
          divisor += 1
      return factors