An algorithm takes 1 second for input size 10. Estimate the number of seconds the algorithm would require on the same computer when the input size doubles (20), triples (30), and quadruples (40) if its running time is each of the following:
O (log n), O (log^2 n), O (n), O (n log n), O (n^2), O (n^2 log^2 n), O (n^3), O (2^n), O (n^n)
