(d) Convert the following CFG to Chomsky Normal Form (CNF): SaXY/YbXXZYZ/aYbY/Za/ Question 2 Build a deterministic pushdown automata (DPDA) that accepts the language L={(ab)n(aa)m(ba)n11,m1} over the alphabet ={a,b}