olve the recurrence f(1) = 1; f(2) = 2, f(n) = 4f(n~2) n when n >2. Your solution need not be precise. It is sufficient to give a simple explicit (rather than recursive) function g(n) such that for every n 1: 0.01g(n) f(n) 100g(n). (If you cannot prove that your g(n) indeed estimates f(n) as above, plotting the first 106 values of f(n) and your conjectured g(n) is sufficient; in that case, plot must be included)