input: Write a python function to return the prime factors of a given number.
  assert prime_factors(24) == [2, 2, 2, 3]
  assert prime_factors(30) == [2, 3, 5]
  assert prime_factors(17) == [17]
output: def prime_factors(n):
      factors = []
      divisor = 2
      while n >= 2:
          while n % divisor == 0:
              factors.append(divisor)
              n //= divisor
          divisor += 1
      return factors