ANSWER AS SOON AS POSSIBLE

(6) (1) Construct a PDA A equivalent to the following context-free grammar that accepts the same language by empty stack. G=({S, A, B}, {a,b}, {S-A4, ASA b}, S) Test whether abab is accepted by PDA A. (2) Build the reduced Context-free Grammar without null productions equivalent to the following grammar: SABAC A+AE BaBE C C