input: Write a function to determine if a given list of integers contains only prime numbers, and return a list of booleans where each element is True if the corresponding element in the input list is a prime number, and False otherwise. The function should be named `check_lst` and takes a single parameter `lst` which is a list of integers.
  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([13, 17, 19, 23, 29]) == [True, True, True, True, True]
  assert check_lst([]) == []
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]