input: Write a function to check whether each element in a given list of integers is a prime number, returning a list of booleans where each element is `True` if the corresponding integer is prime and `False` otherwise.
  assert check_lst([7, 8, 12, 19, 22, 23])==[True, False, False, True, False, True]
  assert check_lst([2, 10, 11, 9, 13])==[True, False, True, False, True]
  assert check_lst([23, 25, 29, 31])==[True, False, True, True]
  assert check_lst([4, 6, 8, 9])==[False, False, False, False]
  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]