Suppose A and B are two arrays of sizes m and n, respectively, which contain sorted

elements in non-decreasing order.

a) Write an algorithm that merges these items into an array C of size m+n.

b) Compute the time complexity of your algorithm.

c) Write a C++ program that tests your algorithm.