1. (a) (10) Implement queue using two stacks. You should implement Enqueue and Dequeue operation. Assuming the size of stacks is unlimited. Just give pseudo-code and describe how it works. (b) (5) From the queue you implemented in (a), in which the operations Push and Pop each have cost 1 (that is O(1)), what is the worst-case costs of Enqueue and Dequeue? (c) (10) What is the average-case costs of Enqueue and Dequeue? Why?(Hint: Amortized Analysis!)