Challenge: Finding the Top 3 Hardest-Working Employees

Several employees work at the factory, and we need to identify the three hardest-working employees based on the number of hours worked.

1. Sort the list of workers in ascending order by the number of hoursWorked using the comparingInt() method.
2. Reverse the list of workers to make it descending by the number of hoursWorked using the reversed() method.
3. Select the top three workers with the highest hoursWorked using the limit() method.
4. Print each of these three workers to the console.