input: Write a function to find prime numbers up to a given number n using Python. The function should iterate from 2 to n, check each number using a helper function to determine if it is prime, and print each prime number.
  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
  
  def find_primes_up_to(n):
      # Iterate from 2 to n
      for num in range(2, n + 1):
          # Check if the number is prime
          if is_prime(num):
              print(num)
  
  assert find_primes_up_to(10)
  # Expected output: 
  # 2
  # 3
  # 5
  # 7
  assert find_primes_up_to(20)
  # Expected output: 
  # 2
  # 3
  # 5
  # 7
  # 11
  # 13
  # 17
  # 19
  assert find_primes_up_to(5)
  # Expected output: 
  # 2
  # 3
  # 5
  assert find_primes_up_to(1)
  # Expected output: 
  # (None, as there are no prime numbers less than 2)
  assert find_primes_up_to(0)
  # Expected output: 
  # (None, as there are no prime numbers less than 2)
output: def find_primes_up_to(n):
      for num in range(2, n + 1):
          if is_prime(num):
              print(num)