input: Write a function to check if a given number is prime. If the given number is greater than 1, the function should iterate through all numbers from 2 to the number itself and check if the number is divisible by any of these numbers. If it is divisible, the function should return False. If the number is not divisible by any of these numbers, the function should return True. If the given number is less than or equal to 1, the function should return False.
  def primeCheck(num):
   if num > 1:
    for i in range(2, num):
     if (num % i) == 0:
      return False
    return True
   else:
    return False
  
  assert primeCheck(2) == True
  assert primeCheck(3) == True
  assert primeCheck(4) == False
  assert primeCheck(1) == False
  assert primeCheck(0) == False
output: def primeCheck(num):
   if num > 1:
    for i in range(2, num):
     if (num % i) == 0:
      return False
    return True
   else:
    return False