Q2. [20 marks] Describe an algorithm sameStack that takes as parameters two stacks of integers and returns true if the two stacks are equal and that returns false otherwise. To be considered equal, the two stacks would have to store the same sequence of integer values in the same order. Your algorithm should examine the two stacks but for full points must return them to their original state before terminating. You may use one stack as auxiliary storage. Addendum for clarification added 26/2/21: You may use fundamental/standard stack methods pop, push, top, and size without writing extra pseudocode for the those methods