$(5$ points code in write$-$up$.5$ points code in $m-$file$)$ Write Matlab code for Algorithm $9$ in section $5\mathrm{.}4.$

This algorithm uses the merge function to implement the mergesort algorithm.

ALGORITHM $9$ A Recursive Merge Sort.

proceduremergesort $(L=a_1,$dots,$a_n)$

$ifn>1$ then

$m$:$={|}_{{?}_{?}}\frac{n}{2_{{?}_{?}}}|$

$L_1$:$=a_1,a_2,$dots,$a_m$

$L_2$:$=a_{m+1},a_{m+2},$dots,$a_n$

$L$:$=$ merge $(mergesort(L_1),$ mergesort $(L_2))$

$\{Lis$ now sorted into elements $in$ nondecreasing order $\}$