C++ code

Problem 3 [15 pts) Write a C++ function called mergeArrays. It should accept three integer arrays: A, B and C. and two integers m and n representing the sizes of the first two arrays. It can be assumed that the size of C is m+n. Arrays A and B contains integers that are already sorted in the ascending order (i.e. increasing order). Your function must combine all the numbers in A and B and store them C in such a way that is also sorted in the ascending order. Here is an example to clarify the requirements. In this case, the sizes of A and B are 6 and 4 respectively. AO 4.5 57 9 B-1036 -110 10/3 4 5 5 679 Note: You can use as many loops as you like, but this task should be accomplished without the use of nested loops. In particular, you should not apply any sorting algorithm to this problem. You cannot use or create any other function