input: Write a function to rewrite the provided code snippet to find prime numbers using Python. The function should define a helper function to check if a number is prime and then iterate through a range of numbers to print all prime numbers within that range.
  assert is_prime(2)==True
  assert is_prime(3)==True
  assert is_prime(4)==False
  
  for n in range(2, 11):
      if is_prime(n):
          print(n)
output: def is_prime(n):
      if n <= 1:
          return False
      for i in range(2, int(n**0.5) + 1):
          if n % i == 0:
              return False
      return True
  
  def find_primes(start, end):
      for n in range(start, end + 1):
          if is_prime(n):
              print(n)