A set of n sumo wrestlers are facing off in the annual tournament. Each wrestler i E [1..n] has an associated strength si and weight W;. We say that wrestler i can yeet wrestler j if si>s; and wi > Wj; that is, if i is both stronger and heavier than j. A wrestler j is unyeetable if no wrestler i can yeet j. Design an O(n lg n) algorithm to find all the unyeetable wrestlers. For simplicity, you may assume that n is a power of 2