input: Write a python function to find prime factors of a number.
  assert find_factors(15) == [3, 5]
  assert find_factors(28) == [2, 2, 7]
  assert find_factors(100) == [2, 2, 5, 5]
  assert find_factors(37) == [37]
output: def find_factors(n):
      factors = []
      divisor = 2
      while n > 1:
          while n % divisor == 0:
              factors.append(divisor)
              n //= divisor
          divisor += 1
      return factors