**PLEASE ANSWER QUESTIONS 1 & 2, THANK YOU!

1.) 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 (n log(n))	O (2n)
1,000	5	5	5	5	5
2,000
3,000		45
10,000

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

2.) Trace a walkthrough of:

a.) Linear search for 7 in -7 1 3 3 4 7 11 13

b.) Binary search for 8 in -7 2 2 3 4 7 8 11 13

THANK YOU!