For heapsort, what are the best and worst initial arrangements of the elements to be sorted, as far as the execution time of the algorithm is concerned? Justify your answer.

procedure heapsort(T[1..n]) (T is an array to be sorted) make-heap(T) for i ? n downto 2 do exchange T[1] and T[i) sift-down TI..t -1],1)