Construct an npda for the language generated by this grammar:

$S$aSB$|bA$

$AaA|a$

$BbBB|b$

$($a$)$ Show the general state diagram of such npda constructed from grammar rules.

$($b$)$ Add edge transitions $($input symbol, top stack symbol, output string$)$ from

production rules to the above diagram.