input: Write a function in Python 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.
  
  def is_prime(n):
      # check if n is divisible by any of the numbers
      # between 2 and n-1
      for i in range(2, n):
          if n % i == 0:
              return False
      return True
  
  def check_lst(lst):
      # generate a list of booleans 
      # where each element corresponds to the corresponding
      # element of lst
      result_lst = []
      for i in range(len(lst)):
          if is_prime(lst[i]):
              result_lst.append(True)
          else:
              result_lst.append(False)
      return result_lst
  
  # Test cases
  assert check_lst([7, 8, 12, 19, 22, 23]) == [True, False, False, True, False, True]
  assert check_lst([2, 3, 4, 5, 6, 7]) == [True, True, False, True, False, True]
  assert check_lst([11, 13, 17, 19, 20]) == [True, True, True, True, False]
  assert check_lst([49, 50, 51, 52, 53]) == [False, False, False, False, True]
  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
      
      result_lst = []
      for num in lst:
          result_lst.append(is_prime(num))
      return result_lst