1)What is the largest n for which one can solve a certain problem within an hour using an algorithm that requires f(n) bit operations, where each bit operation is carried out in 10^-7 seconds, where f(n) = 2²ⁿ?

2)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 f(n) = n³?

	A.	multiplies the time by 6.
	B.	multiplies the time by 3.
	C.	multiplies the time by 8.
	D.	multiplies the time by 2.
	E.	multiplies the time by 2 and adds 2n milliseconds.
	F.	adds 100 milliseconds.
	G.	multiplies the time by 4.
	H.	adds a negligible (<< 1) constant number of milliseconds.
	I.	multiplies the time by 2n.
	J.	multiplies the time by 7.
	K.	multiplies the time by 5.

3)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 f(n) = log n?

	A.	multiplies the time by 2.
	B.	multiplies the time by 7.
	C.	multiplies the time by 3.
	D.	adds a negligible (<< 1) constant number of milliseconds.
	E.	multiplies the time by 4.
	F.	adds 1 millisecond.
	G.	multiplies the time by 2 and adds 2n milliseconds.
	H.	multiplies the time by 5.
	I.	multiplies the time by 2n.
	J.	multiplies the time by 6.
	K.	adds 100 milliseconds