Sorting
In this question, we need to divide, sort, and merge a list of Employees using the multithreading framework. Create a class named EMPLOYEE that holds the employee’s ID (integer value of unique value) and salary (integer value).
Step1: The main thread creates a list of 10,000 Employees with sequential IDs (1 to 10,000 to keep them unique) and randomly generated salaries (between 1500 to 4000); name this list EmpList.
Step2: Split the generated list EmpList into two lists of equal length: List1, and List2.
Step3: Create two threads; each thread should sort the corresponding list (thread1 sorts List1, and thread2 sorts List2) ascendingly with respect to the salary.
Step4: The main thread then waits for the two threads, then merge the two sorted sublists (List1 and List2) into the main list (EmpList) ascendingly with respect to the salary.
Submission: 1. Use the IDE you find appropriate to develop your Java programs, and then create one PDF file where you list/copy the code
you developed for each question along with a screenshot for the outputs (of question 1 only).
2. Submit ONE ZIP/RAR file for the developed Java files and the PDF, named lastname_firstname.zip, directly to the folder titled Assignment 1 under the D2L Assignments tab (other formats will not be accepted).
