input: Write a function `check_lst(lst)` that takes a list of integers `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. Define a helper function `is_prime(n)` to check if a number `n` is prime by checking divisibility from 2 to `n-1`. 
  
  assert check_lst([7, 8, 12, 19, 22, 23])==[True, False, False, True, False, True]
  assert check_lst([2, 4, 5, 6, 11, 15])==[True, False, True, False, True, False]
  assert check_lst([1, 3, 7, 9, 13, 17])==[False, True, True, False, True, True]
  assert check_lst([])==[]
  assert check_lst([1])==[False]
output: def check_lst(lst):
      def is_prime(n):
          if n <= 1:
              return False
          for i in range(2, n):
              if n % i == 0:
                  return False
          return True
      return [is_prime(x) for x in lst]