figure (maxheap after buildheap phase figure heap after first deletemax analysis of heapsort as we saw in the first phasewhich constitutes the building of the heapuses less than comparisons in the second phasethe ith deletemax uses at most less than log ( comparisonsfor total of at most log (ncomparisons (assuming > consequentlyin the worst caseat most log (ncomparisons are used by heapsort exercise asks you to show that it is possible for all of the deletemax operations to achieve their worst case simultaneously