describe how to find the furthest pair of values in a sorted array of numbers (where ""furthest"" means maximizing the difference in their values). what is the time complexity?