A question on pda


#1

Construct a grammar s->aSb | A,A->bSa | S | A to a pda that accepts the same language by empty stack


#2