Question 1: Let A and B be two sorted arrays of n elements each (thus A + B has 2:n elements in total). Give an algorithm that finds the median of AUB. This is a number that is larger and equal of half the elements, and is strictly smaller than half of the elements. Remark: For simplicity assume that every value appears at most once in AUB. Example: A= B = The number 17 is at least as large as and smaller than