Q$\mathrm{.}3.$b$.(15$ pts$)$ Using the heap that has been constructed in Q$\mathrm{.}3.$a$,$ you are expected to make a heapsort on it$.$ This heapsort is to be shown as in the way done in the class. In other words, you will start with your Q$\mathrm{.}3.$a$.$ array, let name it as $"$

heap.Ar$",$ then you are expected to continue heap sort from the beginning up to the end. Pay attention to the indices of the array.

The table below is a sample, if you want, it can be extended as needed, or you may not use all the rows given. In other words, you can add or delete rows if needed.