Translate the following C code into a corresponding MIPS assembly code. Add as much comments as you can for readability.

/* * C code */

#include

int a[13] = {5, 2, 15, 3, 7, 15, 8, 9, 5, 2, 15, 3, 7};

int main(void) {

int i, j, count = 0;

int num = 13;

int largest = 0;

for(i = 0; i < num; i ++) {

printf(%d , a[i]);

};

printf( );

for(i = 0; i < num; i ++) {

j = compare (largest, a[i]);

switch (j) {

case 0:

printf(bigger.. );

largest = a[i];

count = 1;

break;

case 1:

printf(same.. );

count ++;

break;

case 2:

printf(smaller.. );

break;

};

};

printf(The largest number is %d. , largest);

printf(the largest number is included %d times. , count); }

int compare(int a, int b) {

if (sub(a, b) > 0) {

return 2;

}

else if (sub(a, b) == 0) {

return 1;

}

else { return 0;

};

}

int sub(int a, int b) {

return (a b);

}