What is the effect in the time required to solve a prob-\ lem when you double the size of the input from

n

to\

2n

, assuming that the number of milliseconds the algo-\ rithm uses to solve the problem with input size

n

is each\ of these functions? [Express your answer in the simplest\ form possible, either as a ratio or a difference. Your an-\ swer may be a function of

n

or a constant.]\ a)

loglogn

\ b)

logn

\ c)

100n

\ d)

nlogn

\ e)

n^(2)

\ f)

n^(3)

\ g)

2^(n)\ discrete math

What is the effect in the time required to solve a problem when you double the size of the input from n to 2n, assuming that the number of milliseconds the algorithm uses to solve the problem with input size n is each of these functions? [Express your answer in the simplest form possible, either as a ratio or a difference. Your answer may be a function of n or a constant.] a) loglogn b) logn c) 100n d) nlogn e) n2 f) n3 g) 2n