1. This problem explores how, when using a faster computer, thespeedup is affected by the algorithm's complexity. Suppose we cansolve a problem size n in time t on a particularcomputer. Now we are given a computer 16 times faster. In the sametime t, approximately what size problem can you solve withthe following complexities: θ(n), θ(n2) ,θ(2n) ? Show any work you need todo the problem.