R14.6 Suppose an algorithm takes five seconds to handle a data set of 1,000 records. Fill in the following table, which shows the approximate growth of the execution times depending on the complexity of the algorithm.

	O(n)	O(n2)	O(n3)	O(nlogn)	O(2n)
1,000	5	5	5	5	5
2,000
3,000		45
10,000

For example, because 3000210002=9, the algorithm would take 9 times as long, or 45 seconds, to handle a data set of 3,000 records.

O (n)