Suppose we have 2 algorithms that solve the same problem, alg1 and alg2, both of which take as input a natural number n and produce the same output. Were going to consider the number of steps required to solve the problem taken by each algorithm. alg1 solves the problem in 3 2ⁿ steps alg2 solves the problem in 20 n² steps For small values of n, alg1 solves the problem in fewer steps than alg2, but the running time of alg1 grows faster than the running time of alg2. Find the smallest natural number n such that alg2 solves the problem in fewer steps than alg1.