input: Write a function to determine if each element in the given list of integers is a prime number. Return a list of booleans where each element corresponds to whether the element in the input list is a prime number (True) or not (False). If the given list is empty then return an empty list.
  
  assert check_lst([7, 8, 12, 19, 22, 23]) == [True, False, False, True, False, True]
  assert check_lst([11, 13, 17, 18, 25]) == [True, True, True, False, False]
  assert check_lst([2, 3, 5, 7, 11]) == [True, True, True, True, True]
  assert check_lst([4, 6, 9, 12]) == [False, False, False, False]
  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(num) for num in lst]