Define a Java class called Employee. The class has data members and accompanying accessor and mutator methods for each of the following six data items. (This involves creating the file Employee.java.) * id (string) * name (string) * salary (double) * department (string) * position (string) * years of service (integer)

Create a text (data) file containing data for at least five different employees (objects). Let each data item sit on its own line in the text file. For example, the first six lines of the file might look like:

Heap is a tree-based data-structure that satisfies the heap property. A max-heap is a complete binary tree in which the value in each internal node is greater than or equal to the values in the children of that node.

By having a heap (or an array that satisfies the heap property), it would be more efficient (generally faster) to perform important tasks on the array such as finding the maximum element in the array (and removing it) and sorting the array.

In this assignment, you will have to write a program that reads a list of employees from a file. The name of the file will be Employee.txt. The program should output the *sorted* array to a file called SortedEmployee.txt