Q-1. Let a b } be the alphabet set. Write a Context free grammar CFG for each of the following languages: a) {a" b1+1 en , n b = (1) b) { an+2 b" EN (1) c) R.E. = b(a+b)* (1) d) R.E. = (ab + b)* (1) e) R.E. = ab(ba)* + bb (1) Q-2. Let { a b } be the alphabet set. Construct Push down Automata PDA for each of the following languages: a) {a" 51+1 EN n, n b (2.5) b) { an+2b" en) (2.5)