input: Write a function to check if the elements of a given list of integers are prime numbers. The function should return a list of booleans where each boolean is `True` if the corresponding element in the input list is a prime number, and `False` otherwise. If the input list is empty, return an empty list.
  assert check_lst([7, 8, 12, 19, 22, 23]) == [True, False, False, True, False, True]
  assert check_lst([2, 3, 4, 5]) == [True, True, False, True]
  assert check_lst([]) == []
  assert check_lst([17, 21, 29, 31]) == [True, False, True, True]
  assert check_lst([97, 98, 99, 100]) == [True, False, False, False]
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]