3. Construct npda's that accept the following languages on 5 = {a,b). (a) L = {a"/3n.n>0} (b) L = {a"bn+ mon > 0,m> 1} () {w:na(w) = 2ny(w)} (d) {w: 2na(w) S ns(w) 3na(w)} 4. Show that the following languages are deterministic context-free languages. (a) L = {a"/m:m > n +2} (b) L = {UUR: {a,b}"} (c) {w {a,b}": na(w) * now)} 3. Constructnpda