What does this code accomplish? subi $sp,$sp,8 sw $3,4($sp) sw $4,0($sp)     push the contents of $3, then $4, onto stack     pop from stack into $3, then pop from stack into $4     push the contents of $4, then $3, onto stack     pop from stack into $4, then pop from stack into $3

Electrical Engineering Department Name: Microprocessors (8022125-4) - Chapter 2 Quiz 2 ins In some applications, all registers are saved at the beginning of a sibroutine. Assume thatSP=1932Hbefore a near subroutine CALL. Show the contents of the stack poiller and the memory contents of the stack after the commands: \[ \mathrm{AX}=15 \mathrm{ABH}, \mathrm{BX}=3 \mathrm{C} 16 \mathrm{H}, \mathrm{CX}=5678 \mathrm{H}, \mathrm{DX}=7823 \mathrm{H}, \mathrm{FP}=\mathrm{A} 43 \mathrm{FH} \]

All files are included below, seperated by the dashes. "----" //driver.cpp  #include <iostream> #include <string> #include "stackLL.h" #include "queueLL.h" #include "priorityQueueLL.h" using namespace std; int main() { /////////////Test code for stack /////////////// stackLLstk; stk.push(5); stk.push(13); stk.push(7); stk.push(3); stk.push(2); stk.push(11); cout<<"Popping: "<<stk.pop() <<endl; cout<<"Popping: "<<stk.pop() <<endl; stk.push(17); stk.push(19); stk.push(23); while( ! stk.empty() ) { cout<<"Popping: "<<stk.pop() <<endl; } // output order: 11,2,23,19,17,3,7,13,5 stackLLstkx; stkx.push(5); stkx.push(10); stkx.push(15); stkx.push(20); stkx.push(25); stkx.push(30); stkx.insertAt(-100, 3); stkx.insertAt(-200, 7); stkx.insertAt(-300, 0); //output order: -300,30,25,20,-100,15,10,5,-200 while( ! stkx.empty() ) cout<<"Popping: "<<stkx.pop() <<endl; ///////////////////////////////////////…