Consider two arrays A[1..n] and B[1..n]. A is sorted in monotonically increasing order, while B is sorted in monotonically decreasing order. Write the pseudocode of an algorithm MergeTwoArrays(A,B,n) which merges the arrays A and B. The resulting array C is sorted in monotonically increasing order. The running time of your algorithm must be O(n).

MergeTwoArrays(A,B,n)

//allocate a new array C[1...2n]

add your pseudocode here

return C