Chapter: Data Structure and C++ This is a practice on implementing the heap structure and heapsort algorithm followed by analyzing it in terms of space and time complexity. For sake of simplicity consider an array of n integer elements, data, to be sorted in ascending order. Implement the heapSort using a max-heap data structure. a. Write a function named heapSort() that given a list of integers, sorts them in ascending order using the heapSort algorithm (heapSort.cpp).

b. Calculate the time complexity of heapSort() function (solution.pdf).

c. Calculate the space complexity of heapSort() function (solution.pdf).

d. Do you think using a min-heap rather than a max-heap in your heapSort() where data is still sorted in ascending order would change the efficiency of the algorithm (solution.pdf)