Suggest a new variant of heapsort that utilizes extra arrays. Assume you can use as many arrays as

you need. You can use the arrays in any step of heapsort. In your heapsort variant, did the extra

memory help in lowering the time needed by the algorithm, or more time is needed now? If the

time complexity is still O$($nlogn$)$ did the constant needed change?