input: Write a function to determine if a list of integers contains only prime numbers by returning a list of booleans where each element is `True` if the corresponding element in the input list is a prime number, and `False` otherwise. If the input list is empty, return an empty list.
  
  def is_prime(n):
   # check if n is divisible by any of the numbers
   # between 2 and n-1
   for i in range(2, n):
   if n % i == 0:
   return False
  
   return True 
  
  def check_lst(lst):
   if lst == []:
   return []
   
   result_lst = []
   for i in range(len(lst)):
   if is_prime(lst[i]):
   result_lst.append(True)
   else:
   result_lst.append(False)
  
   return result_lst
  
  assert check_lst([7, 8, 12, 19, 22, 23]) == [True, False, False, True, False, True]
  assert check_lst([]) == []
  assert check_lst([2, 3, 5, 7, 11]) == [True, True, True, True, True]
  assert check_lst([4, 6, 8, 9, 10]) == [False, False, False, False, False]
  assert check_lst([1, 29, 31]) == [False, True, True]
output: def check_lst(lst):
      if lst == []:
          return []
      
      result_lst = []
      for num in lst:
          if num > 1:
              for i in range(2, int(num**0.5) + 1):
                  if (num % i) == 0:
                      result_lst.append(False)
                      break
              else:
                  result_lst.append(True)
          else:
              result_lst.append(False)
      
      return result_lst