input: Write a function to check if a list of integers consists entirely of prime numbers by returning a list of booleans where each boolean is True if the corresponding integer is a prime number, and False otherwise. If the input list is empty, return an empty list.
  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
  
  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([]) == []
  assert check_lst([2, 3, 5, 7]) == [True, True, True, True]
  assert check_lst([4, 6, 8, 9]) == [False, False, False, False]
  assert check_lst([1]) == [False]
output: def check_lst(lst):
      result_lst = []
      for num in lst:
          result_lst.append(is_prime(num))
      return result_lst