Implementation of Merge Sort Example $[0,3,5,3,9\%$narr$.$length; Fation merge$($arr$,1,,$r$)(>$sar t$=$tex irexy$($pm$1)$; sar $4=$tex iexp$($a$2)$; for $($var $10$; $1<$n; $10)($i$[1]=$arr$\backslash \{1+$i$\backslash \}$for $($var j$=0$;j$-$tau$)[$return; var parseInt$(\backslash$langler $-1\backslash$rangle$(3)$Bergesort$($arr$.1.")$; mergesort $($are$,,)$; werge$($arr$,1,1$console$.$log$(\text{'}$before sorting mergesort$($art$,,1)$; cowole.log$($After sorting art$)$;

Explain this code line by line