input: Write a python function to print all prime numbers between 0 and a given number.
  assert find_primes(10) == [2, 3, 5, 7]
  assert find_primes(20) == [2, 3, 5, 7, 11, 13, 17, 19]
  assert find_primes(5) == [2, 3]
output: def find_primes(n):
      def is_prime(num):
          if num <= 1:
              return False
          for i in range(2, int(num**0.5) + 1):
              if num % i == 0:
                  return False
          return True
      
      primes = []
      for i in range(n):
          if is_prime(i):
              primes.append(i)
      return primes