1. Johnson wants to express algorithms for solving a network productivity problem and system performance problem for his Zoom application usage. How can he express the running times of the above algorithms to foster their easy comparison? 2. Without calculating, how can you determine the asymptotic rate of growth of the expression? Give an appropriate example to illustrate your answer.

Anshyper sonic (sega)

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 + '%';   }}