input: Write a function to determine prime numbers using Python. The function should take an integer `num` and return True if it is a prime number, otherwise return False. Additionally, write a loop to print all prime numbers from 2 to `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 n in range(2, n+1):
      # Check if the number is prime
      if is_prime(n):
          print(n)
output: def is_prime(num):
      if num < 2:
          return False
      for i in range(2, int(num ** 0.5) + 1):
          if num % i == 0:
              return False
      return True