input: Write a function that takes a list of integers (denoted by `lst`) and returns a list of booleans where each element of the output list is `True` if the corresponding element in the input list is a prime number, and `False` otherwise.
  
  assert check_lst([7, 8, 12, 19, 22, 23]) == [True, False, False, True, False, True]
  assert check_lst([2, 3, 4, 5, 6]) == [True, True, False, True, False]
  assert check_lst([10, 15, 20, 25, 30]) == [False, False, False, False, False]
  assert check_lst([11, 13, 17, 19]) == [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(x) for x in lst]