C++

kind of stuck on 3 and 4, but I want to check 1 and 2 as well.

Consider two sorted arrays A and B (each of the same size) with unique integers/elements. Assume there are no common elements for both A and B. Develop an algorithm to merge the two sorted arrays A and B (each of size 'n') to generate a new sorted array C of size '2n'. For example, if A = {1, 4, 8, 10, 14) and B = {2, 5, 9, 11, 13), the merged sorted array C should be: (1, 2, 4, 5, 8, 9, 10, 11, 13, 14). (i - 3 pts) Determine the basic operation of the merger algorithm. (ii - 7 pts) Is there a best case different from worst case or the best case is same as the worst case? Justify your answer with an explanation as well as an example. (iii - 7 pls) Depending on your answer for (ii), determine the best case as well as the worst case (if the best case is different from worst case) or just the number of times (if the best case is the same as the worst case) the basic operation is executed as a function of the input size 'n'. Justify your answer. (iv - 3 pts) What is the space complexity of your algorithm in terms of the input size 'n