input: Write a function to check a list of integers and return 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 given list is empty then 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, 7])==[True, True, False, True, False, True]
  assert check_lst([])==[]
  assert check_lst([0, 1, 2, 13])==[False, False, True, 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
      
      return [is_prime(num) for num in lst]