For a linear complexity, the effect of doubling the input size on the computation time effectively can be seen as: f(n)f(2n)=kn=k(2n)=2(kn)=2f(n) which means the time effectively doubles. We call this value the doubling-ration (r=2). Determine the doubling ratio r for each of the following complexities [ignore any additional lower ordered terms] (a) quadratic (b) nonic (c) O(n1)