You are given as input two sorted arrays

A=[a_(1),dots,a_(n)]

and

B=[b_(1),dots,b_(n)]

. Each array is sorted so that

A\\\\cup BO(logn)b_(1). Find the median element of A\\\\cup B in O(logn) time using a divide and conquer algorithm. You can assume there are no duplicates in the arrays, all elements are distinct numbers.\ Explain your algorithm in words and provide pseudocode. State the running time and explain (by stating the relevant recurrence).a_(1) and b_(1). Find the median element of A\\\\cup B in O(logn) time using a divide and conquer algorithm. You can assume there are no duplicates in the arrays, all elements are distinct numbers.\ Explain your algorithm in words and provide pseudocode. State the running time and explain (by stating the relevant recurrence).

You are given as input two sorted arrays A=[a1,,an] and B=[b1,,bn]. Each array is sorted so that a1