What is the time complexity of the following algorithm? Assume that the number of elements in array $A$ is equal to

N$.$

A: array of numbers

low: lowest index of array $(0)$

mid: index of array $A,$ low $$ mid $$ high

high: highest index of array A $($Number of elements $-1)$

function $,$ low, mid, high$)$

for $i$ mid

$B[i]=A[i]$

for $i<mtext\; id="EditorElement\_1033491"></mtext><mi\; id="EditorElement\_1033492">(</mi>$high$-$mid$)$

$c[i]=A[i+$mid$+1]$

$i=0$;$j=0$;$k=0$

while$(i$ mid AND $j<mtext\; id="EditorElement\_1033343"></mtext><mi\; id="EditorElement\_1033344">(</mi>$high$-$mid$))$

if $A[k]=B[i]i=i+1A[k]=C[j]j=j+1k=k+1i>$midj$$mWhat $is$ the time complexity $of$ the following algorithm? Assume that the number $of$ elements $in$ array $Ais$ equal $to$

$N.$

$A$: array $of$ numbers

low: lowest index $of$ array $(0)$

mid: index $of$ array $A,$ low $$ mid $$ high

high: highest index $of$ array $A(Numberof$ elements $-1)$

function $,$ low, mid, high