input: Write a python function to determine the prime factorization for a given number.
  assert prime_factorization(56) == [2, 2, 2, 7]
  assert prime_factorization(84) == [2, 2, 3, 7]
  assert prime_factorization(97) == [97]
output: def prime_factorization(n):
      factors = []
      divisor = 2
      while n > 1:
          while n % divisor == 0:
              factors.append(divisor)
              n //= divisor
          divisor += 1
      return factors