ONLY USE STACK ADT METHODS. USE PYTHON. NO LIST METHODS.

PART 1:

PART 2:

Show how to use the transfer function, described in PART 1, 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, dont just plug in a number and few transfer operations without a clear explanation)

Implement (Simply type your answer as a python function, you are not required to submit amy 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