Answer Happy

Theory of Computation.
Please type your solution very clearly
1 1. For this problem we will show that NP is closed under union and concatenation. Formally, suppose let Li and L2 be formal languages, with L1, L2 E NP (a) (5 points) Prove that Li U L2 = {w/w E L1 and we L2} E NP (b) (5 points) Prove that Li o L2 = {w/w = xy for some x e L1, y E L2} E NP = =