the drawbacks/disadvantages of using recursive program include the followingfor some programmers and readersrecursion is difficult concept recursion is implemented using system stack if the stack space on the system is limitedrecursion to deeper level will be difficult to implement aborting recursive program in midstream can be very slow process using recursive function takes more memory and time to execute as compared to its nonrecursive counterpart it is difficult to find bugsparticularly while using global variables the advantages of recursion pay off for the extra overhead involved in terms of time and space required points to remember stack is linear data structure in which elements are added and removed only from one endwhich is called the top hencea stack is called lifo (last-infirst-outdata structure as the element that is inserted last is the first one to be taken out in the computer' memorystacks can be implemented using either linked lists or single arrays the storage requirement of linked representation of stack with elements is (nand the typical time requirement for operations is ( infixprefixand postfix notations are three different but equivalent notations of writing algebraic expressions in postfix notationoperators are placed after the operandswhereas in prefix notationoperators are placed before the operands postfix notations are evaluated using stacks every character of the postfix expression is scanned from left to right if the character is an operandit is pushed onto the stack elseif it is an operatorthen the top two values are popped from the stack and the operator is applied on these values the result is then pushed onto the stack multiple stacks means to have more than one stack in the same array of sufficient size recursive function is defined as function that calls itself to solve smaller version of its task until final call is made which does not require call to itself they are implmented using system stack exercises review questions what do you understand by stack overflow and underflow differentiate between an array and stack how does stack implemented using linked list differ from stack implemented using an array differentiate between peek(and pop(functions why are parentheses not required in postfix/prefix expressions explain how stacks are used in non-recursive program what do you understand by multiple stackhow is it useful explain the terms infix expressionprefix expressionand postfix expression convert the following infix expressions to their postfix equivalents(aa (ba ( ( ( ( ( dd ( (( bd (( fg)(fa ( cd ef ( convert the following infix expressions to their postfix equivalents(aa (ba ( ( ( ( ( dd ( (( bd (( fg)(fa ( cd ef ( find the infix equivalents of the following postfix equivalents