Select all the correct facts from the list below.The size of the returned array c is m$+$n$.$The merge algorithm runs in time Theta$($m$+$n$).$If the loop in lines $14-16$ execute for at least one iteration, then the loop in lines $17-19$ will execute for zero iterationsWhenever line $7$ is reached during the execution of the algorithm, the array c is in fact the merge of the subarrays a$[0,$dots,i$-1]$ and b$[0,$dots,j$-1].$