Please answer the question as soon as possible and i will surely upvote the answer (Theory of Computation and Compiler Design Question)

(b) i) Consider the grammar G whose productions are SaSAB,A,B, D b. Construct a grammar G1 without null productions generating L (G) {}. ii) Convert the following Push Down Automata to Context Free Grammar M=({q0,q1},{a,b}{z0,za},,q0,z0,) where is given by (q0,a,z0)=(q0,zaz0) (q0,a,za)=(q0,zaza) (q0,b,za)=(q1,) (q1,b,za)=(q1,) (q1,,z0)=(q1,)