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. The given array is denoted by `lst` and if the input list is empty, return an empty list.
  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([]) == []
  assert check_lst([11, 13, 17, 18, 20]) == [True, True, True, False, False]
  assert check_lst([15, 25, 35, 45, 55]) == [False, False, False, False, False]
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
      
      return [is_prime(num) for num in lst]