write program to evaluate postfix expression write program to convert an infix expression that includes ()+-*and to postfix add the exponentiation operator to your repertoire write program to convert postfix expression to infix write routines to implement two stacks using only one array your stack routines should not declare an overflow unless every slot in the array is used propose data structure that supports the stack push and pop operations and third operation findminwhich returns the smallest element in the data structureall in ( worst-case time prove that if we add the fourth operation deletemin which finds and removes the smallest elementthen at least one of the operations must take (log ntime (this requires reading show how to implement three stacks in one array if the recursive routine in section used to compute fibonacci numbers is run for is stack space likely to run outwhy or why not deque is data structure consisting of list of items on which the following operations are possiblepush( )insert item on the front end of the deque pop()remove the front item from the deque and return it inject( )insert item on the rear end of the deque eject()remove the rear item from the deque and return it write routines to support the deque that take ( time per operation write an algorithm for printing singly linked list in reverseusing only constant extra space this instruction implies that you cannot use recursion but you may assume that your algorithm is list member function can such an algorithm be written if the routine is constant member function write an array implementation of self-adjusting lists in self-adjusting listall insertions are performed at the front self-adjusting list adds find operationand when an element is accessed by findit is moved to the front of the list without changing the relative order of the other items write linked list implementation of self-adjusting lists suppose each element has fixed probabilityp of being accessed show that the elements with highest access probability are expected to be close to the front efficiently implement stack class using singly linked listwith no header or tail nodes efficiently implement queue class using singly linked listwith no header or tail nodes efficiently implement queue class using circular array you may use vector (rather than primitive arrayas the underlying array structure linked list contains cycle ifstarting from some node pfollowing sufficient number of next links brings us back to node does not have to be the first node