10. (a) Given a large unordered array of n distinct integers, a[0]... a[n-1), we wish to find the maximum drop over any contiguous sub-array. The drop over the sub-array a[j]... a[k], where j