Suppose that l and r are lists of integers. You do not know the lengths of the lists, or what their elements are. However, if the elements of each list are sorted into nondecreasing order, then MERGE$($l$,$ r$)$ returns a new list that has all the elements of l and r$,$ also sorted into nondecreasing order.

$01$ MERGE$($left$,$ right$)$

$02$ both $=[]$

$03$ while LENGTH$($left$)>0$ and LENGTH$($right$)>0$

$04$ if HEAD$($left$)<$ HEAD$($right$)$

$05$ both $=$ both $[$ HEAD$($left$)]$

$06$ left $=$ TAIL$($left$)$

$07$ else

$08$ both $=$ both $[$ HEAD$($right$)]$

$09$ right $=$ TAIL$($right$)$

$10$ return both $$ left $$ right

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