Use MIPS assembly language. Write the recursive function

int largest( int [] A, int size, int i)

{

if (i== size-1) return A[i];

else {

if (A[i] > largest(A, size, i+1))

return A[i];

else

return largest(A, size, i+1);

}

}