An input array B contains 2k -1 distinct elements (k is a positive integer). All elements in B are arranged in ascending order. The constructHeap algorithm in Heapsort is applied to B to construct a...

An input array B contains 2k
-1 distinct elements (k is a positive integer). All
elements in B are arranged in ascending order. The constructHeap algorithm in
Heapsort is applied to B to construct a maximizing heap. Analyze how many key
comparisons are performed in this heap construction. Your result must be in terms
of k.