Tamarindo Airlines wants to give a first class upgrade coupon to their top log n frequent flyers, based on the number miles accumulated, where n is the total number of the airlines frequent flyers. The algorithm they currently use, which runs in O(n log n) time, sorts the flyers by the number of miles flown and then scans the sorted list to pick the top log n flyers. Describe an algorithm that identifies the top log n flyers in O(n) time.

Please who can help with this question in Java.