1) Describe the term stack and also describe the Push and Pop operation.
2) Transform the following infix expression into its equivalent postfix and prefix expression:
(A+B^D)/ (E-F) +G
3) Describe the term underflow and overflow with respect to the stack.
4) prepare down the program for stack using the array.
5) Transform the infix expression into its equivalent postfix expression by using stack.
6) Determine the postfix expression for the following given expression:
P : 6,2,3,+,-,3,8,2,/,+,*,2,^,3,+
7) prepare down a program for calculating the factorial of number by using the recursion.