On an initially empty stack data structure, the following transactions have been made:

push( A ); push( B ); push( C ); pop(); pop(); push( D ); pop(); pop();

a) What will be the data retrieved as a result of the pop operations, respectively?

b) Does the stack have to be empty to get the same output? (assume no stack overflow)