Using MIPS and using SPIM simulator.

Problem 2. Write a recursive function that computes the smallest integer in a given array of integers. Use the following algorithm: int Min( int JA, int low, int high)t if (low high) { return Allow]:3 int mid-(low+high)/2; int mini = Min(A, low, mid); int min2 = Min(A, mid +1, high); if (minl>min2) { return min else return minl;} 2;) Also, write a main program that calls the Min function on the following data and prints out the result. A = {5, 2,-9, 10,-23, 43, 2, 1, 3, 5, 10), low = 0, and high = 10