input: Write a function to check if a number is a prime number and then use this function to generate a list of booleans where each boolean corresponds to whether the number in a given list of integers is a prime number. Return the list of booleans. If the given 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, 7, 8]) == [True, True, False, True, False, True, False]
  assert check_lst([]) == []
  assert check_lst([1]) == [False]
  assert check_lst([29, 30, 31, 32]) == [True, False, True, False]
output: def check_lst(lst):
      result_lst = []
      for num in lst:
          result_lst.append(is_prime(num))
      return result_lst