input: Write a function named `check_lst` that takes a list of integers (`lst`) and returns a list of booleans where each element of the output list 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):
      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, 5, 7, 11]) == [True, True, True, True, True]
  assert check_lst([4, 6, 8, 9, 10]) == [False, False, False, False, False]
  assert check_lst([]) == []
  assert check_lst([1, 0, -1]) == [False, False, False]
output: 
  def check_lst(lst):
      def is_prime(n):
          if n <= 1:
              return False
          for i in range(2, n):
              if n % i == 0:
                  return False
          return True
      
      result_lst = []
      for num in lst:
          result_lst.append(is_prime(num))
      return result_lst
  