input: Write a function to determine if each element in the given list of integers is a prime number and return a list of booleans corresponding to the primality of each element. The function should take a list of integers as input and return a list of booleans. 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, 6, 7]) == [True, True, False, True, False, True]
  assert check_lst([]) == []
  assert check_lst([1]) == [False]
  assert check_lst([29, 31, 37, 41, 43]) == [True, 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]