Array A is filled with the numbers from $(2^$h $-1)$ down$-$t$0(1)($i$.$e$.$ in descending order$)$

a$)$ What's the time complexity of Build$-$Max$-$Heap for this case?

b$)$ Let h $=3,$ list the elements in array A after executing the for$-$loop of the HEAPSORT$($A$)$ for three cycles.