Given an (unsorted) set X = {x0, x1, . . . , xn1} [0, 1] of n real numbers in the interval [0, 1] (You can assume that X is given as an array). The task is an interval [away] with b a = 1 2 to be found such that |X [a, b]| is as large as possible. Design an algorithm that solves the problem. Justify its correctness and estimate Get the best possible estimate of its worst-case runtime. The running time of your algorithm should be in o(n2) lie (small-o, so the algorithm should be asymptotically faster than n2 being)