a) Determine the list of production rules for the Context Free Grammar that can produce palindromes of ={a,b}. (5 Marks) b) Prove that the CFG written above can produce the string "ababa" using the CYK (Cocke Younger and Kasami) Algorithm. (15 Marks) c) Draw and explain the working of a Push Down Automata that accepts strings of the pattern anb2nc3n={a,b},n>=1. (10 Marks)