input: Write a function to determine if the given number is a prime number. If it is a prime number return True else return False. In case the number is less than or equal to 1, return False.
  def is_prime(number):
      if number <= 1:
          return False
      for i in range(2, int(number**0.5) + 1):
          if number % i == 0:
              return False
      return True
  
  assert is_prime(2)==True
  assert is_prime(17)==True
  assert is_prime(4)==False
  assert is_prime(1)==False
  assert is_prime(0)==False
output: def is_prime(number):
      if number <= 1:
          return False
      for i in range(2, int(number**0.5) + 1):
          if number % i == 0:
              return False
      return True