input: Write a function to determine if a given number is prime. The function should return True if the number is prime and False otherwise. If the given number is less than 2, the function should return False.
  assert is_prime(3) == True
  assert is_prime(4) == False
  assert is_prime(29) == True
  assert is_prime(1) == False
  assert is_prime(0) == False
output: def is_prime(n):
      if n < 2:
          return False
      for i in range(2, int(n**0.5) + 1):
          if n % i == 0:
              return False
      return True