v$-$Implement an algorithm using divide and conquer technique: Given two sorted arrays of

size m and n respectively, find the element that would be at the kth position in combined

sorted array.

a$.$ Write a pseudocode$/$describe your strategy for a function kthElement$($Arr$1,$ Arr$2,$ k$)$

that uses the concepts mentioned in the divide and conquer technique. The function

would take two sorted arrays Arr$1,$ Arr$2$ and position k as input and returns the

element at the kth position in the combined sorted array.

b$.$ Implement the function kthElement$($Arr$1,$ Arr$2,$ k$)$ that was written in part a$.$ Name

your file KthElement.py

Examples:

Arr$1=[1,2,3,5,6]$ ; Arr$2=[3,4,5,6,7]$ ; k$=5$

Returns: $4$

Explanation: $5$th element in the combined sorted array $[1,2,3,3,4,5,5,6,6,7]$ is $4$