Theory of Computation

1-Draw NPDA for the following languages L={a" b2n,n20} L={a?"b",n20) 2-Write a context free grammar for the following languages L={a"b",n2m) L={a"c"b"k",n,m20) L={www}, we{a,b) L={w, number of a's equal to the number of b's), we{a,b}