First part is pretty straight forward so I'm pretty sure I did that right. I'm slightly confused on how to do the Question 4. The way I was thinking of it is we transfer the elements from stack S to an empty stack, then those will be in reversed order. Then we transfer those to another empty stack and those will be in the original order. Then after that, we finally transfer back to S and they'll be in reverse order. At least in my head thats how I would do it. Is this correct and how should I write it? Thanks.

Question 3: 20 points No partial creditl: Implement (Simply type your answer as a python function, you are not required to submit any Python code) a function with signature transfer(S, T) that transfers all elements from stack S onto stack T, so that the element that starts at the top of S is the first to be inserted onto T, and the element at the bottom of S ends up at the top of T. Question 4: 20 points [ No partial credit]: Show how to use the transfer function, described in Question 3, and two temporary stacks, to replace the contents of a given stack S with those same elements, but in reversed order. (In order to get credit for this question explain clearly how many transfers it will be needed and what each transfer does, don't just plug in a number and few transfer operations without a clear explanation)