input: Write a function to determine if a given number is prime or composite. If the number is prime, return False, otherwise return True. If the given number is less than 2, return True since numbers less than 2 are considered neither prime nor composite.
  assert is_prime(10)==True
  assert is_prime(7)==False
  assert is_prime(2)==False
  assert is_prime(1)==True
  assert is_prime(0)==True
output: def is_prime(n):
      if n < 2:
          return True
      for i in range(2, int(n**0.5) + 1):
          if n % i == 0:
              return True
      return False