MIPS Assembly Language Recursion Problems

1. Write a MIPS Assembly Language recursive function that computes the smallest integer in a given array of integers. Use the following algorithm:

int Min(int[] A, int low, int high)

{ if (low == high) return A[low];

int mid = (low + high) / 2;

int min1 = Min(int[] A, low, mid);

int min2 = Min(int[] A, mid + 1, high);

if(min1 > min2) return min2;

return min1;

}

2. Write a MIPS Assembly Language recursive function that compute the Comb(n, r) where n >= r and n, r >= 0

Comb(n, r) = 1 if n = r or r = 0

Comb(n, r) = Comb(n - 1, r) + Comb(n - 1, r - 1)