Design a PDA which accepts all strings which can be derived from the following Grammar. Taking a suitable example verify the machine. S -> aB/bA A -> a/aS/bAA B -> b/bS/aBB