Suppose Touch ’n Go eWallet is running a program to reward its customers for using
the apps. The top log n customers, based on the amount of money spent for each
month, where n is the total number of customers for the month will be rewarded RM99
cashback. Suggest TWO (2) algorithms that can retrieve the top log n customers in:
(a) O(n log n) time
(b) O(n) time
Guidelines: Your algorithm can be given in the form of pseudo code or Java program. You will be
judged based on:
 Clarity of the solution (e.g. reproducible in programming form etc. by the reader)
 The solution must reflect the required algorithm complexity. Justify your answer.

This question is from chegg, but I need two java program, not algorithm or pseudocode, can you help me?