1. Write a sorting algorithm in pseudocode, that takes an array A with n elements and uses two stacks to sort it. You may only compare array elements to stack elements in your sort, that is, you may not compare array elements to each other. You may assume the following stack ADT methods: push(0): Insert object o at the top of the stack pop (): Remove and return element from top of the stack, provided it is not empty top(): Returns the top element from the stack without removing it, provided it is not empty isEmpty(): Returns true is the stack is empty and false otherwise Analyze the worst-case running time of your algorithm