3. (20 pts) Execute program max Heap.java and heap Application java: a) Insert the nodes listed in 2(a) to the heap. Show screenshot. b) Display the heap array and compare it with the array in 2(a). What do you find out? 4. (30) Referring to maxHeap java and heap Application java, write the class for max-heap of Employee records. (The Employee class is given below. The employee seqNo is used as key). The program must contain the following 4 operations: – – – – Build a heap by a given array of Employee. Extract an employee with the maximum seqNo from the heap. Insert a new employee record into the heap. Print the heap with all employee’s seqNo and salary Test Run: Write a Main method to test your program as follows: – Create an array A of Employee records. Create an empty max-heap. Assign 10 employee records one by one into th array A in the following order: recordl: namel, 1048 record 2: name2, 1078 record 3: name3, 1065 record4: name4, 1088 records: name5, 1098 record√≥name, 1099 record 7: name 7, 1054 record 8: name8, 1062 record 9: name9, 2000 record 10: ame 10, 1085 – Build the max-heap from above array of Employee, and print the heap. Extract an employee record with the maximum SeqNo, and print the heap Insert a new employee record into the heap, and print the heap. Show screenshots of above operations – – public class Employee Watch Risky Business (1983) Full Movie Online Free – 123Movies Watch… public class Employee public int id; public String name; public double salary: public void Input() System.out.println(“Enter name: “); name = new Scanner(System.in).nextLine(); System.out.println(“Enter ID: “); id – Integer.parseInt(new Scanner(System.in).nextLine()); System.out.println(“Enter Salary: “); salary – Double.parseDouble(new Scanner(System.in).nextLine()); public void Output() Systen.out.printf(“Name: $1$s, ID: X2$s, Grade: %3$s”, name, id, salary); public String toString() return String.format(“Name: $1$s, ID: X2$, Grade: %3$s]”, nane, id, salary); A sample output may look like the following: HeapArray A: [name110481624) [name2/10781589) [name3110651816] [name4110881534) [name5110981179) (namc6110991375) [name 7110541842) [name8110621949) [name9120001506) [name:110851347) Enter operation code: 1-Extract 2 Insert 3-Display 4-Exit A sample output may look like the following: HeapArray A: [namell10481624) [name2/10781589] [name3110651816] [name4110881534] [name5110981179) [name6110991375) [name 7110541842] [name8110621949) [name9120001506] [name:110851347] Enter operation code: 1-Extract 2-Insert 3-Display 4-Exit heapArray: [name9120001506) [name6110991375) [name51109811791 (name4110881534) (name:110851 347) (name3110651816) [name 7110541842) [name 1110481624] [name8110621949] (name21 10781589) [name9120001506) [name6110991375] [name4110881534] [name:110851347] [namel110481624] [name8110621949] [name2/10781589] [name511098179) [name3110651816] [name 7110541842) Enter operation code: 1-Extract 2-Insert 3-Display 4-Exit Enter operation code: 1-Extract 2-Insert 3-Display 4-Exit heapArray: [name6110991375] [name4110886534) (name5110981179) (name2110781589) (name:110851 347) (name3110651816] [name 7110541842) [name 1110481624) (name8110621949) [name6110991375) [name4/10881534) [name5110981179] [name2/10781589] [name:10851347] [name 3110651816] [name 7110541842] [name 1110481624) (name8110621949)