Help explain the answer to this question

Assume alist is a list of integer elements and stk is a stack of integers. A pair of loops first copies the elements from the list to the stack and then copies the elements from stack back to the list. Compare the order of the elements (select a or b) in the original list and the final list. Loop 1: while(alist.empty)) stk.push (alist.back)) alist.pop_back Loop 2: while(!stk.empty )) alist.push front (stk.top ()) stk.pop) The two copies produce the same ordering in the new list The two copies reverse the ordering in the new list 4 of 4