Show that, over the unary alphabet sigma = {0}, if a language has the pumping property for regular languages then it also has the pumping property for context-free languages.
(note that this means that when you prove, using the pumping lemma, that a language over a unary alphabet isn't context-free, you have also proved that it isn't regular.)

Answerautofilter;

Answerdetailed systems design;

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