Write a MIPS assembly code for the following C code in part (a) and (b).

a) clear array code in C clear1 (int array[], int size)

{

int i;

for (i = 0; i < size; i += 1)

arrayli] = 0;

}

1. For example, in part (a) write a MIPS assembly code using pointers.
2. Which one of the two MIPS codes generated in part (a) and (b) is computationally efficient and why?
3. Assuming the array size is 10 compute the number of instruction executions saved by the computationally efficient approach.