What is the worst$-$case run time of MERGE$($l$,$ r$)?$ Do not write your answer using O$,\backslash$Omega $,$ or $\backslash$Theta $.$ Your answer must be in the form T$($l$,$ r$)=$ p$,$ where p is an expression stated in terms of LENGTH$($l$)$ and$/$or LENGTH$($r$).$ Hint: assume that line $07$ executes in $0$ time.