hi please help me answer this question correctly and accurately please don't copy paste answer

QUESTION1 : [10 POSSIBLE POINTS]

18

13

11

7

14

10

4

25

5

A) Apply heap sort in the following array and show your work over the tree you build. Show all your steps.

Kindly please note CODE is NOT required .. solution must be over the tree show your max heapify calls like (A,1,9) ...

B) How many times the max-heapify function is called through the entire sorting.