(Solved) : Please Answer 3 Questions Struggling 3 Moment Related Construct Max Heap Using Bottom Floy Q26839078 . . . .

Please answer all 3 questions as I am struggling withall 3 at the moment and they are all related.

a) Construct a max heap using the bottom up(Floyd) algorithm on the keys 4,6,3,7,5,4 inserted in that order.Show the construction by drawing the binary tree at each stage thata key is inserted and/or swapped with another key.

b) Heap Sort utilises the Floyd algorithm inits first stage to sort an unordered array. Write pseudocode forthe second stage of the Heap Sort Algorithm which then transformsthe heap into an ordered array. Use ascending order.

c) State the worst case complexity of:
i) Floyd (bottom up) algorithm