Suppose you were given two stacks and one or two additional storage registers, R1 and R2. Stack one contains data, stack two is empty. Create an algorithm (expressed in English or pseudocode) that will reverse any two adjacent entries in stack one, using only the stack operations PUSH and POP. When done, all of the data should end up in stack one. You may also use control instructions such as while().