Convert the following recursive C program into MIPS assembly using recursion.

Adding the members of a sequence is essentially a recursive operation, in that cach time, the sum is updated by adding a new term to the sum consisting of all the terms before it, therefore we always calculate sum(n) sum(n-1)+n term. Thus, we can have the following recursive definition: 0, sum(n-1)+a(n), if n 0 otherwise sum(n) The following C program implements this recursion: #1 nc 1 ude #1nclude int sum(int *myArray, int n); int main(int argc, char **argv) int *array-(int malloc(10*sizeof (int)): for (int ?-1; i