Design an assembly program that includes a RECURSIVE function for computing the largest number in an array of $32-$bit integers. All function parameters must be passed in stack.

The first function MAX$1($int array$[],$ int from, int to$)$ should accept an array passed by reference and two indices "from" and $"$to$"$ passed by value. It should be based on the divide$-$and$-$conquer approach to compute the maximum by splitting the array A into two $($almost$)$ equal parts A$\_0$ and A$\_1$ in the middle, recursively compute the maximum m$0$ over A$\_0$ and m$1$ over A$\_1,$ and return the maximum of two numbers m$0$ and m$1.$ It should be invoked as MAX$1($A$,0,$ n$),$ where n is the array length. In other words, the recursive formula is as follows:

max$\{$a$0,$ a$1,...,$ an$-1\}=$ max$\{$m$0,$ m$1\}=$ max$\{$max$\{$a$0,...,$ an$/2\},$ max$\{$an$/2+1,...,$ an$-1\}\}$

where m$0=$ max$\{$a$0,...,$ an$/2\}$ and m$1=$ max$\{$an$/2+1,...,$ an$-1\}$

Please be in the form:

;$-------------------------------------$

AREA RAM, DATA, NOINIT, READWRITE, ALIGN$=3$

;$-------------------------------------$ ;

AREA $|.$text$|,$ CODE, READONLY

main PROC ; main user code

loop ; periodic task starts here

b loop ; repeat periodic task

ENDP

;$-------------------------------------$

;prompt DCB "Enter a number: $",0$

ALIGN

END