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 the number of milliseconds the algorithm used to solve the problem with input size n is each of these functions.
a) log log n
b) log n
c) 100n
d) n log n
e) n^2
f) n^3
g) 2^n

Go to this site

https://www.slader.com/discussion/question/what-is-the-effect-in-the-time-required-to-solve-a-problem-when-you-double-the-size-of-the-input-fro/

there should the your answer

Step-by-step explanation:

i'm pretty sure it's 477,585,296, but perhaps my math is incorrect.

make sure you have version 2.50

try looking in the very back of the book : )

step-by-step explanation:

you can download it here