For each of the following problems, all functions should be implemented using a call stack. Problem 2: Write a program that defines two integer array that are pre-sorted and the same size (e.g., [3,...

For each of the following problems, all functions should be implemented using a call stack. Problem 2: Write a program that defines two integer array that are pre-sorted and the same size (e.g., [3, 7, 9, 11, 15, 21] and [1, 4, 6, 14, 18, 19]) and a function merge that takes the two arrays (and their size) as inputs and populates a single array of twice the size of either input array that contains the elements of both arrays in ascending order. In the example arrays given, then output would be [1, 3, 4, 6, 7, 9, 11, 14, 15, 18, 19, 21]. Have your 'main' function (not the merge function) print out the final array using a comma as a delimiter.