input: Write a function to identify prime numbers in a list of integers and return a list of booleans indicating whether each element is a prime number or not. The function should be named `check_lst` and it takes a single argument `lst` which is a list of integers. The function should return a list of booleans where each boolean corresponds to whether the respective integer in `lst` is a prime number. If the input list is empty, the function should return an empty list.
  assert check_lst([7, 8, 12, 19, 22, 23])==[True, False, False, True, False, True]
  assert check_lst([2, 3, 4, 5])==[True, True, False, True]
  assert check_lst([6, 8, 10, 12, 14])==[False, False, False, False, False]
  assert check_lst([29, 31, 56, 79])==[True, True, False, 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]