Problem
1. Presently we can solve problem instances of size 30 in 1 minute using algorithm A, which is a Θ(2 n) algorithm. On the other hand, we will soon have to solve problem instances twice this large in 1 minute. Do you think it would help to buy a faster (and more expensive) computer?
2. Consider the following algorithm:
(a) What is the output when n = 2, n = 4, and n = 6?
(b) What is the time complexity T(n)? You may assume that the input n is divisible by 2.