input: Write a function to identify if a provided number is prime or composite. If the number is prime return True else return False. If the number is less than 2, return False.
  assert is_prime(10) == False
  assert is_prime(7) == True
  assert is_prime(0) == False
  assert is_prime(1) == False
  assert is_prime(29) == True
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