Computer Science, asked by maneeshmadhavjh9222, 10 hours ago

Show that np is closed under union and concatenation

Answers

Answered by itsbindassqueen34
1

Answer:

(a) Show that NP is closed under union. Answer: Let L1 and L2 be languages in NP. ... Therefore, the union L3 of two languages in NP is also in NP, so NP is closed under union.

THIS IS THE RIGHT ANSWER

Explanation:

Similar questions