input: Write a function to determine if each element in a given list of integers is a prime number and return a list of boolean values indicating whether each element is a prime number or not. If the given list is empty then return an empty list.
  assert is_prime(7) == True
  assert is_prime(8) == False
  assert is_prime(12) == False
  assert is_prime(19) == True
  assert is_prime(22) == False
  assert is_prime(23) == True
  assert check_lst([7, 8, 12, 19, 22, 23]) == [True, False, False, True, 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
      
      return [is_prime(num) for num in lst]