Please provide verified, correct solution. Thank You.

50 points Write a MIPS assembly program that finds the maximum number in an integer array using a recursive procedure. Normally, we can write a for loop that scans through the array and compute the maximum number. Instead, we will use an alternate recursive algorithm. The pseudocode for the algorithm is given below. Here, FindMax is the recursive procedure to be implemented. This procedure takes as input an array of n numbers (you will need two arguments: base address of array and length of the array). It then compares the first element in the array with the maximum of the rest of the n-1 numbers (by making a recursive call), and returning the one that is greater. FindMax(Alo] AIn) if (n1) return Al0]; if (A0 FindMax (AlI],, Aln) return Al0 else return FindMax(A],..., Aln]) Your implementation must correctly create and destroy the stack frame for each invocation of the recursive procedure. You must also use the calling convention described in class: The first four input arguments must be in $a0-$a3 and the remaining (if anyust be passed through the stack. Likewise, the first two output arguments must be in $vo--$v1 and the remaining (if any) must be passed through the stack. 50 points Write a MIPS assembly program that finds the maximum number in an integer array using a recursive procedure. Normally, we can write a for loop that scans through the array and compute the maximum number. Instead, we will use an alternate recursive algorithm. The pseudocode for the algorithm is given below. Here, FindMax is the recursive procedure to be implemented. This procedure takes as input an array of n numbers (you will need two arguments: base address of array and length of the array). It then compares the first element in the array with the maximum of the rest of the n-1 numbers (by making a recursive call), and returning the one that is greater. FindMax(Alo] AIn) if (n1) return Al0]; if (A0 FindMax (AlI],, Aln) return Al0 else return FindMax(A],..., Aln]) Your implementation must correctly create and destroy the stack frame for each invocation of the recursive procedure. You must also use the calling convention described in class: The first four input arguments must be in $a0-$a3 and the remaining (if anyust be passed through the stack. Likewise, the first two output arguments must be in $vo--$v1 and the remaining (if any) must be passed through the stack