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