input: Write a function to generate a list of booleans where each element in the output list is `True` if the corresponding element in the input list is a prime number, and `False` otherwise. The function should take a list of integers `lst` as input.
  assert check_lst([7, 8, 12, 19, 22, 23])==[True, False, False, True, False, True]
  assert check_lst([1, 2, 3, 4, 5])==[False, True, True, False, True]
  assert check_lst([])==[]
  assert check_lst([4, 6, 8, 9, 10])==[False, False, False, False, False]
  assert check_lst([11, 13, 17, 19, 23])==[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(x) for x in lst]