Write a recursive function in MIPS Assembly Language 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;

}