For the set of numbers {1, 2, 3, 4, 5, 6, 7}, which input elicits the best/worst case for the Heapsort algorithm? (Here, the sole measure of complexity is the number of comparisons made throughout the execution of the algorithm which includes building the max-heap). For each case, give the sequence of comparisons made, and the total.