Let S be a (not necessarily sorted) sequence of n different integers. An integer x in S is called as approximate median of S if |{y ? S: y < x}| ? n/4 and |{y ? S: y > x}| ? n/4 . Design an O(n) time algorithm to find all the approximate medians of S