What is the maximal number of swap operations performed during the process of selecting consecutive minima during the execution of the heap-sort algorithm? in your count skip the swap operations performed during the process of creating the initial heap. assume that the input array has size n.
(i) express your answer in the form of a sum.
(ii) remove the symbol of summation and analyze the order of growth.

Answercombo box

Function tipcalculate (slider, bill){  var tip = document.getelementbyid('tipamount');   var slideval = document.getelementbyid('slideval');   var bill = document.getelementbyid(bill).value;   var prcnt = slider * .01;       if (bill == null || bill == '') {      tip.innerhtml = ' enter an amount';       return false;   }  if(isnan(bill)) {      tip.innerhtml = ' enter a number';       return false;   }  if(bill > = 0){      tip.innerhtml = '$' + (bill * prcnt) .tofixed(2);   slideval.innerhtml = slider + '%';   }}