Assume that the keys in an array A are given as

$-143-106-552.$ That is$,$ A$[1]=-1,$ A$[2]=4,$ etc.

Write the result with all the intermediate steps

in a sequence when MergeSort$($A$,1,8)$ is invoked.

$2.$ Write the result with all the intermediate steps

in a sequence when BuildMaxHep$($A$)$ is invoked.

$3.$ Write the result with all the intermediate steps

in a sequence when Partition$($A$,1,8)$ is invoked