Feel free to use any theorem required.

3. Apply the theorem covered in class to convert the following grammar G- (S, A, (begin, end, ;, aj, P, S) where P is defined below to a PDA M accepting the same language by empty stack. No credit will be given if your design an equivalent PDA from scratch. G: S->begin A end