Suppose an initially empty stack S has executed a total of 25 push operations, 12 top operations, and 10 pop operations, 3 of which raised Empty errors that were caught and ignored. What is the...

Suppose an initially empty stack
S
has executed a total of 25 push operations,

12 top operations, and 10 pop operations, 3 of which raised Empty

errors that were caught and ignored. What is the current size of
S?

Implement 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.