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

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

$157,$ class slides $04$p$1$ #$9).$

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

HEAPSORT$($A$)$ for three cycles. The HEAPSORT algorithm is in the textbook page

$160,$ and class slides $04$p$1$ #$12.$