TASK 3 : CODING BY USING HEAP PRIORITY QUEUE PLEASE ~! THANKS

Requirement A priority queue is an abstract data type that each element has a priority" associated with it. An element with high priority is served before an element with low priority. If two elements have the same priority, they are served according to their order in the queue. You are require to design and develop an interactive program that will simulate a job distribution system using priority concepts and operations. Job with the highest priority will be assigned to the employee first. Your program must consist of the following operations: - Set the maximum heap for priority queue Check for empty priority queue - Check for full priority queue Insert job name and its priority value to priority queue / Remove job name with highest priority value Print the size of priority queue Display the priority queue's content Clear the priority queue Duplicate job is not allowed Task 1: Solution Algorithm Design a solution algorithm using pseudocode based on requirement above. Task 2: Flowchart Create a flowchart to depict the actual workflow of the program. Task 3: Program Implementation Convert your solution algorithm to a complete Java application