input: Write a function to find prime numbers up to a given number using Python. The function should take an integer as input and print all prime numbers from 2 to that number. The function should use the is_prime helper function to determine if a number is prime.
  def find_primes(n):
      def is_prime(num):
          # Iterate from 2 to the square root of the number
          for i in range(2, int(num ** 0.5) + 1):
              if num % i == 0:
                  return False
          return True
  
      # Iterate from 2 to n
      for num in range(2, n + 1):
          if is_prime(num):
              print(num)
  
  assert find_primes(7)==2,3,5,7
  assert find_primes(13)==2,3,5,7,11,13
  assert find_primes(31)==2,3,5,7,11,13,17,19,23,29,31
  assert find_primes(1)==None
  assert find_primes(0)==None
output: def find_primes(n):
      def is_prime(num):
          for i in range(2, int(num ** 0.5) + 1):
              if num % i == 0:
                  return False
          return True
  
      for num in range(2, n + 1):
          if is_prime(num):
              print(num)