Professor Lessiarty directs an underground network of n criminal masterminds called Lessiartys Web. He has heard that famed detective Sherlatch Houses is hot on his trail and needs to decide whether to issue an attack on detective Houses. Professor Lessiarty decides to consult with the Web and compiles a list of n polls, where each poll is a tuple matching a different Web members name with their integer opinion on the topic. Opinion +x means they are for attacking Houses with strength x, while opinion x means they are against attacking Houses with strength x. Lessiarty wants to generate a list containing the names of the lg n Web members that have the strongest opinions (breaking ties arbitrarily), so he can arrange a secret meeting to discuss with them further. Describe an O(n)-time algorithm to generate Lessiartys list..