Write a program that generate a PDA to recognize the language {0^n1^n}. Also, develop a GUI in any language to allow the user to input the string, show the stack activity (push or pop) at any given character of the input string.

For example: If the user inputs 0011. The PDA should accept the string and also show that the stack is empty. Hence, accepted. IF tthe user inputs 00011, the PDA should reject the string and show that the stack is NOT empty due to unequal number of zeros and ones.