Theory of computation:: please I need a full answer for all questions (4)

HOME-WORK 1-Draw NPDA for the following languages L={011 1",n20) L={02n10,n20) 2-Write a context free grammar for the following languages L={0-1,n2m} L={acmbmko,n,m20} L={wow).wela.b) LE{w, number of a's equal to the number of b's), wela.b) 3-Prove that CFL are closed under union and star operations and not closed under intersection. 4-derive the following sentences from the grammar you write LE{w, number of a's equal to the number of b's), wela.b)* -abbbaa -bababbaa -aaabbb -bbaa -abab