input: Write a function that takes a list of integers (denoted by `lst`) and returns a list of booleans where each element of the output list is `True` if the corresponding element in the input list is a prime number, and `False` otherwise. If the input list is empty, the function should 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([1, 2, 3, 4, 5]) == [False, True, True, False, True]
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
      
      result_lst = []
      for num in lst:
          result_lst.append(is_prime(num))
      return result_lst