input: Write a function to determine if a list of integers contains only prime numbers by returning 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 list is empty, return an empty list.
  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])==[True, True, True, True]
  assert check_lst([4, 6, 8, 9])==[False, False, False, False]
  assert check_lst([11, 13, 17, 19])==[True, True, True, True]
output: def check_lst(lst):
      def is_prime(n):
          if n <= 1:
              return False
          for i in range(2, int(n**0.5) + 1):
              if n % i == 0:
                  return False
          return True
      
      return [is_prime(num) for num in lst]