Consider a set S of n greaterthanorequalto 2 distinct numbers all greater than zero in unsorted order. For each of the problems below: Give an algorithm to determine two distinct numbers x and y in the set S that satisfy the condition(s) of the problem. Your algorithm must be specified using in the style of the text. You must justify that your algorithm has the requested runtime. in 0(n Ig n) time, determine x, y Element S such that x notequalto y and |x-y| lessthanorequalto |w - z| for all w, z lessthanorequalto S such that w notequalto z. in O(n) time, determine x, y Element S such that |x-y| greaterthanorequalto |w-z| for all w, z Element S for all w, z Element S such that w notequalto z