show that np is closed under the star operation. (hint: it might be slightly easier to use the alternative view of np as languages that have polynomial-time verifiers; what should a verifier look for in the proof?) this is not required but think about how to prove that p is closed under the star operation
