The Grinch is given the employment of dividing 2n players into two groups of n players each. Every player has a numerical rating that measures how great he/she is at the amusement. He looks to isolate the players as unreasonably as could be expected under the circumstances, in order to make the greatest conceivable ability irregularity between group An and group B. Indicate how the Grinch can carry out the employment in O(nlogn) time.