Consider the recursively defined function, f, below for integers n > 1. Write a non-recursive version of this function and show that the two versions are defining the same function.. 1 if n = 1 (1) f(n) = f(n) = 2f(n-1) + 5 if n > 1