Write a python code to sort an array A in ascending order with below pseudocode and include $5$ test cases:

$\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_$

Heapsort$($A as array$)$

BuildMaxHeap$($A$)$

for i $=$ n to $1$

swap $($A$[1],$ A$[$i$])$

n $=$ n$-1$

Heapify$($A$,1)$

BuildMaxHeap $($A as array$)$

n $=$ elements$\_$in $($A$)$

for i $=$ floor $($n$/2)$ to $1$

Heapify$($A$,$i$)$

Heapify$($A as array, i as int$)$

left $=2$i

$`$ right $=2$i $+1$

if $($left$<=$n$)$ and $($A$[$left$]>$ A$[$i$])$

max $=$ left

else

max $=$ i

if $($right $<=$n$)$ and $($A$[$right$]>$A$[$max$])$

max $=$ right

if $($max $!=$ i$)$

swap$($A$[$i$],$A$[$max$])$

Heapify$($A$,$ max$)$