PART-IV (25 pts): Finding the k-th Smallest Element From Two Sorted Arrays You are given two sorted arrays of integers each of length n where all entries among the two arrays are distinct. You are also given a parameter k s 2n. You want to find the kth smallest entry among all 2n numbers. TODO: Describe an algorithm solving this problem in 0(log n) time. Don't forget to explain why it is O(log n). Let's call the two arrays a[0..n-1] and b[o..n-1]. Comments/discussion/hints: It means we are looking for the minimum If k=1, it must mean what? element overall. If k=2n, we are looking for the maximum element. If k=n, we are looking for the median element. Some things to consider: Under what conditions would a[n] be the k-th smallest? Under what conditions would a[n-1] be the k-th smallest? Under what conditions would a[k-1] be the k-th smallest? (same questions for array b[]). Hopefully by answering these questions, you will gain some insight leading to a general solution