stacksqueuesand deques - show how to use stack and queue to generate all possible subsets of an -element set nonrecursively - postfix notation is an unambiguous way of writing an arithmetic expression without parentheses it is defined so that if "(exp op (exp )is normalfully parenthesized expression whose operation is opthe postfix version of this is "pexp pexp op"where pexp is the postfix version of exp and pexp is the postfix version of exp the postfix version of single number or variable is just that number or variable for examplethe postfix version of "(( ( ))/ is " /describe nonrecursive way of evaluating an expression in postfix notation - suppose you have three nonempty stacks rsand describe sequence of operations that results in storing all elements originally in below all of ' original elementswith both sets of those elements in their original order the final configuration for should be the same as its original configuration for exampleif [ ] [ ]and [ ]the final configuration should have [ and [ - describe how to implement the stack adt using single queue as an instance variableand only constant additional local memory within the method bodies what is the running time of the push()pop()and top(methods for your designc- describe how to implement the queue adt using two stacks as instance variablessuch that all queue operations execute in amortized ( time give formal proof of the amortized bound - describe how to implement the double-ended queue adt using two stacks as instance variables what are the running times of the methodsc- suppose you have stack containing elements and queue that is initially empty describe how you can use to scan to see if it contains certain element xwith the additional constraint that your algorithm must return the elements back to in their original order you may only use sqand constant number of other variables - modify the arrayqueue implementation so that the queue' capacity is limited to maxlen elementswhere maxlen is an optional parameter to the constructor (that defaults to noneif enqueue is called when the queue is at full capacitythrow full exception (defined similarly to emptyc- in certain applications of the queue adtit is common to repeatedly dequeue an elementprocess it in some wayand then immediately enqueue the same element modify the arrayqueue implementation to include rotatemethod that has semantics identical to the combinationq enqueue( dequeue)howeveryour implementation should be more efficient than making two separate calls (for examplebecause there is no need to modify size