Suppose you have algorithms with the running time listed below(assume these are exact running time) How much slower do each of these algorithms get when you(a) Double the input size (b) increase the input size by one ?
i) n2 ii) n3 iii) 2n iv) n log n