Need the solution of this program STEP-BY-STEP please!

Question 3. (5 marks) Given two sorted arrays of size m and n respectively, give the program in C/C++ that finds the element that would be at the x-th position of the final sorted array. Examples Input: Array 1 : 200212356449870 Array 2: 8296213219365545992 x=7 Output: 356 Explanation: Final sorted array is: 82,96,200,212,213,219,356,365,449,545,870,992 7 th element of this array is 356. HINT: You can use parts of the mergesort algorithm