input: Write a function to determine if an element in a list of integers is a prime number by returning a list of booleans where each boolean corresponds to whether the respective element is prime or not.
  
  def is_prime(n):
      if n <= 1:
          return False
      for i in range(2, n):
          if n % i == 0:
              return False
      return True
  
  def check_lst(lst):
      result_lst = []
      for i in range(len(lst)):
          result_lst.append(is_prime(lst[i]))
      return result_lst
  
  assert check_lst([7, 8, 12, 19, 22, 23]) == [True, False, False, True, False, True]
  assert check_lst([2, 3, 4, 5, 6, 7]) == [True, True, False, True, False, True]
  assert check_lst([1]) == [False]
  assert check_lst([]) == []
output: def check_lst(lst):
      result_lst = []
      for num in lst:
          if num <= 1:
              result_lst.append(False)
              continue
          is_prime = True
          for i in range(2, int(num**0.5) + 1):
              if num % i == 0:
                  is_prime = False
                  break
          result_lst.append(is_prime)
      return result_lst