def interleave $($ L$1,$ L$2)$:

# L$1$ and L$2$ are lists

i $=0$

result $=[]$

while i $<$ min $($len $($ L$1),$ len $($ L$2))$:

result $.$ append $($ L$1[$ i $])$

result $.$ append $($ L$2[$ i $])$

i $+=1$

if len $($ L$1)>$ len $($ L$2)$:

longer $=$ L$1$

else :

longer $=$ L$2$

for j in range $($i $,$ len$($ longer $))$:

result $.$ append $($ longer $[$ j $])$

return result

With regard to the function above:

$$ What is its big$-$O time complexity? Very briefly justify your answer.

$$ If you used any variables, such as N$,$ in your time complexity, define them in term of the function$$s

parameters.