Consider two arrays A[] and B[],if arrays A is in increasing order and array B is in decreasing order is input to join a algorithm. the output is an array C[1…2n] which has all the values of the arrays A[] andB[] and is increasing order . what is the worst case time complexity for join algorith to join two array?

A) O(n^2)

B)O(n)

C)O(1)

D)O(nlogn)