data structures using (aa (babc give the infix expression of the following prefix expressions (aa (ba convert the expression given below into its corresponding postfix expression and then evaluate it also write program to evaluate postfix expression (( )/ write function that accepts two stacks copy the contents of first stack in the second stack note that the order of elements must be preserved (hintuse temporary stack draw the stack structure in each case when the following operations are performed on an empty stack (aadd abcdef (bdelete two letters (cadd (dadd (edelete four letters (fadd differentiate between an iterative function and recursive function which one will you prefer to use and in what circumstances explain the tower of hanoi problem programming exercises write program to implement stack using linked list write program to convert the expression " +binto "ab+ write program to convert the expression " +binto "+ab write program to implement stack that stores names of students in the class write program to input two stacks and compare their contents write program to compute (xy)where (xyf( -yy if ypsx and (xy if < write program to compute (nrwhere (nrcan be recursively defined asf(nrf( - rf( - - write program to compute lambda(nfor all positive values of where lambda(ncan be recursively defined aslambda(nlambda( / if > and lambda( if = write program to compute (mnwhere (mncan be recursively defined asf( , if = or >= >= and ( ,nf( - ,nf( - - )otherwise write program to reverse string using recursion multiple-choice questions stack is (alifo (bfifo (cfilo (dlilo which function places an element on the stack(apop((bpush((cpeek((disempty( disks piled up one above the other represent (astack (bqueue (clinked list (darray reverse polish notation is the other name of (ainfix expression (bprefix expression (cpostfix expression (dalgebraic expression true or false pop(is used to add an element on the top of the stack postfix operation does not follow the rules of operator precedence recursion follows divide-and-conquer technique to solve problems using recursive function takes more memory and time to execute recursion is more of bottom-up approach to problem solving an indirect recursive function if it contains call to another function which ultimately calls it the peek operation displays the topmost value and deletes it from the stack in stackthe element that was inserted last is the first one to be taken out underflow occurs when top max- the storage requirement of linked representation of the stack with elements is ( push operation on linked stack can be performed in (ntime overflow can never occur in case of multiple stacks fill in the blanks is used to convert an infix expression into postfix expression is used in non-recursive implementation of recursive algorithm the storage requirement of linked stack with elements is underflow takes when the order of evaluation of postfix expression is from whenever there is pending operation to be performedthe function becomes recursive function is said to be recursive if it explicitly calls itself