input: Write a function that checks if a given number is prime and then iterates from 2 to a specified limit, printing all prime numbers within that range.
  
  def is_prime(num):
      for i in range(2, int(num ** 0.5) + 1):
          if num % i == 0:
              return False
      return True
  
  def print_primes_up_to(n):
      for num in range(2, n+1):
          if is_prime(num):
              print(num)
  
  assert print_primes_up_to(10) == None
  assert print_primes_up_to(20) == None
  assert print_primes_up_to(5) == None
  assert print_primes_up_to(0) == None
output: def print_primes_up_to(n):
      for num in range(2, n+1):
          if is_prime(num):
              print(num)