input: Write a function to determine if each element in a given list of integers is a prime number, and return a list of booleans indicating the primality of each element. If the corresponding element is a prime number, the boolean value should be True, otherwise it should be False.
  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([100, 101, 102]) == [False, True, False]
  assert check_lst([]) == []
  assert check_lst([1, 2, 3, 4, 5]) == [False, True, True, False, 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]