Question

Explain the answer

QUESTION 8 The classes of languages P and NP are closed under certain operations, and not closed under others, just like classes such as the regular languages or context-free languages have closure properties. Decide whether P and NP are closed under each of the following operations. 1. Union. 2. Intersection. 3. Intersection with a regular language. 4. Concatenation 5. Kleene closure (star). 6. Homomorphism. 7. Inverse homomorphism. Then, select from the list below the true statement. OP is not closed under intersection. Pis not closed under concatenation. NP is not closed under concatenation. Pis not closed under homomorphism. QUESTIONS uning tuneducer T that transforms problem P1 into probem P2. Thas one read-only input tape, on which an input of

Answer 1

Solution 8:-

Correct option - Last bubble (d)

Class P that is polynomial time are closed under Union, intersection , concatenation , complement and class NP is polynomial time verifiers are closed under Union, intersection , concatenation. Class P can be closed under homomorphism if and only if P=NP. Since there exists a condition for the validity of the last option.Therefore, the most apt option is the last option and all other options are false.