Assume we want to merge two sorted sub-arrays each of size N/2 (sorted in the descending order) to create a sorted array of size N sorted in descending order. If the smallest element of the first sub-array is larger than the largest element of the second sub-array, what will be the complexity of merge algorithm in terms of big Oh? Explain your answer.