Consider the following C code

int a, b // global variables

int main()

{

int Q[5]; // array of integers at base address 0x11223344

int less[5]; // array of integers at base address 0x11226677

int ECE375[5]; // array of integers at base address 0x1122AABB

for(int i = 4; i 0; i= i-1)

ECE375[i] = Q[i] - less[i];

int t;

a = 5;

b = 7;

int c = 3;

t = dofsum(a, b, c, 4);

return t

}

int dofsum(int q1, int q2, int q3, int q4)

{

int total;

total = (q1 + q2) - (q3 + q4);

return total;

}

2 Q1 [40 points] Implement the C code in MIPS assembly. Clearly state your assumption. . Q2 [20 points] Draw the snapshot of the stack before, during, and after dofsum()

function call. Assume $SP = 0x45ffff00 before dosum() function call.