Solution should be written in Java Part 1 Implement a priority queue sorting algorithm according to the information in t

[answerhappygod]

Solution should be written in Java
Part 1
Implement a priority queue sorting algorithm according to the
information in the textbookCh.9.
Part 2
(Insertion and selection sort)Implement a priority queue based on
the sorted and unsorted sequence. This will provideyou an insertion
and selection sort when used with the priority sort algorithm from
Part 1.
Part 3
(Heap sort)Implement a priority queue based on the heap data
structure. This will provide you a heapsort when used with the
priority sort algorithm from Part 1.
Part 4
(Experiments)Conduct experiments on the implemented sorting
algorithms (3 algorithms) for arrays of100, 1000, 10 000, 100 000,
500 000, 1 000 000 random integers. You should measure thetime
spent by the computer to sort the arrays. To measure the time use
thenanoT ime() orsimilar method. Record the times for each array
size.
Part 5
(Report)Prepare the report as mentioned earlier. In the report
describe the Priority queue sortingprinciples for each sorting
algorithm and describe the expected time complexity. In the
nextsection describe the experiments you have conducted and provide
a table of running times.In conclusions try to answer the question
if your experiments proved the expected runningtime.You need to
implement the data structures by yourself.