Java code Implement MaxHeap sort algorithms on your computer. Run timings for each algorithm
on arrays of size n = 10i

for i ranging from 1 to as large a value as your computer’s

memory and compiler will allow. Implement the given algorithms in Java-Generic-
Programing, which provide the following menu

1. Insert
2. Delete
3. Search
4. Print ( sorted array , the array size and sort time to the screen)
5. Quit
Then you need to answer the following questions :
 Use the findings that are computed by your program to produce an analysis
document containing a discussion and plots (you’ll plot execution time vs n)
showing the performance of the given algorithms as n (the length of the input
array) changes.
 Then modify your findings by count and print the number of comparisons. This
should be reported as a third column in your output to the screen. Then you need
to discuss your findings in the analysis document.
(Hint: you can use the following segment of code to obtain the execution time and don’t forget to
include #include into your program)
time_t start, end;
double dif;
time (&start); /*Get the current calendar time as a time_t object.*/
// perform the task;
time (&end); /*Get the current calendar time as a time_t object.*/
dif = difftime (end, start); /* Calculates the difference in seconds as a floating point double

between time1 and time2.*/

printf ("It took you %.2lf seconds \n", dif );