in random order write shortstraightline piece of pseudo-code (with no loops or recursionthat uses only one comparison and only one variable xyet guarantees with probability / that at the end of this code the variable will store the largest of alice' three integers argue why your method is correct - describe how to implement the stack adt using two queues what is the running time of the push(and pop(methods in this casec- show how to use stack and queue to generate all possible subsets of an -element set nonrecursively - suppose we have an two-dimensional array that we want to use to store integersbut we don' want to spend the ( work to initialize it to all ' (the way java does)because we know in advance that we are only going to use up to of these cells in our algorithmwhich itself runs in (ntime (not counting the time to initialize ashow how to use an array-based stack storing (ijkinteger triples to allow us to use the array without initializing it and still implement our algorithm in (ntimeeven though the initial values in the cells of might be total garbage - describe nonrecursive algorithm for enumerating all permutations of the numbers { , ,nc- postfix notation is an unambiguous way of writing an arithmetic expression without parentheses it is defined so that if "(exp )op(exp )is normal fully parenthesized expression whose operation is opthen the 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 sofor examplethe postfix version of "(( ( ))/ is " /describe nonrecursive way of evaluating an expression in postfix notation - suppose you have two nonempty stacks and and deque describe how to use so that stores all the elements of below all of its original elementswith both sets of elements still in their original order