You are given a collection of n integers a,..., an with positive weights w,..., wn. For any number a;, we define the bias of a; as: Examples: i.e., the absolute value of the difference between the weights of elements smaller than a; and the remaining ones. Design and analyze an algorithm that in O(n log n) time finds the element that has the smallest bias. You can assume that the input is given in two arrays A[1: n] and W[1: n] where a; = A[i] and w; = W[i]. bing(a;) = w; - j:a,