CE 308 Computing Theory Homework #3 (Sections 2-4) Please upload all answers on a singular.pdf file. Any answers typed in Word or handwritten are fine. Remember academic integrity rules, and good luck! 1. Design a CFG that generates the following language: L = {albi+1a2kblai+11, j, k 2 0} 2. Convert the following CFG to CNF: S AB BCS A AC Bbbbb CCE 3. Design a PDA over the alphabet {a,b} that recognizes the following language: L = {a2b" | n is any positive integer)