input: Write a function to determine if each element in a list of integers is a prime number, and return a list of booleans where each element 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.
  def is_prime(n):
      if n < 2:
          return False
      for i in range(2, int(n ** 0.5) + 1):
          if n % i == 0:
              return False
      return True
  
  def check_lst(lst):
      result_lst = []
      for num in lst:
          result_lst.append(is_prime(num))
      return result_lst
  
  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([9, 25, 14, 7, 13])==[False, False, False, True, True]
  assert check_lst([])==[]
output: def check_lst(lst):
      def is_prime(n):
          if n < 2:
              return False
          for i in range(2, int(n ** 0.5) + 1):
              if n % i == 0:
                  return False
          return True
      
      result_lst = []
      for num in lst:
          result_lst.append(is_prime(num))
      return result_lst