This is a MIPS Assembly coding problem and I need help with it.

*Some experts got this question wrong or in a different language. I would appreciate it if someone answers it correctly

Thank you in advance!

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)\ if (low high) { return Allow]:3 int mid = (low+high)/2; int minl- Min(A, low, mid); int min2-Min(A, mid +1, high); if (minI>min2) f return min2;) else return minl; Also, write a main program that calls the Min function on the following data and prints out the result. A3(5, 2,-9, 10,-23,43, 2, 1, 3,5,10), low-0,and high=10. 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)\ if (low high) { return Allow]:3 int mid = (low+high)/2; int minl- Min(A, low, mid); int min2-Min(A, mid +1, high); if (minI>min2) f return min2;) else return minl; Also, write a main program that calls the Min function on the following data and prints out the result. A3(5, 2,-9, 10,-23,43, 2, 1, 3,5,10), low-0,and high=10