Considering the pseudo code of Heap Sort justify your answers about these questions

a. What will be the running time of Heap Sort if input is sorted in ascending order
b. What will be the running time of Heap Sort if input is sorted in descending order
c. What is best case input (format of input resulting in best case time) for Heap sort.