Problem 3. Given two sorted arrays of size m and n respectively, you are tasked with finding the let that would be at the kth position of the final sorted array if the two arrays are combined to get a sorted array. However, you may or may not need to actually generate the final sorted array. Consider that the array positions start from to actually generate t 1. Give an efficient algorithm to do this. (25 points) For example InputArray-236 79 Explanation: The final sorted array would be 1, 2, 3, 4, 6, 7,8, 9, 10 The 5th element of this array s InputArray 100 112 256 349 770 Array2 72 86 113 119 265 445 892 Output 256 Explanation: Final sorted array is 72, 86, 100, 112 113, 119. 256, 265, 349, 445,770, 892 7th element of this array is 256