Recursive function.Please provide working out and thorough explanation of your working out. Thank you!

3. Consider a function f(n) that is defined recursively as follows: f(n) = { ifn=1, 1 2.-f(i) otherwise. What is the order of f(n)? In other words, find an expression g(n) such that f(n) = (g(n)). Recall that you want g(n) to be as simple as possible. This question does not ask you about an implementation to compute f(n). The question also does not ask you about the time complexity of the implementation to compute f(n)