Problem $3$: Implement a Recursive Merge Sort Function $(20$ points$)$

Witite a program which implements a reaurive merge sorf funcion. An eampla cin be found in the textbook or on the internet

National

UNIVERSITY Increasing. Thls means that at a given index $n,$ the valve at inder $n+1$ s creater than or equal to the value at n$.$ Return ture II thls property holds, folse cthenuse. lse thls header:

bool Ia deceasing $($nit$\text{'}$ values, intesies$)$ chould retuin fale. funcion agains ils chould retum tove. beosuse eadr vila is not less chan lis predeosedi

C$++$ code for the lab project: