Please do ALL PARTS!

2. (a) Suppose a function f(n) is defined by the following recursive formula. 3f(n. 1) 6 f(n) Use the guess-and-check method to get a closed-form formula for f(n). That is, guess a formula for f(n) and use induction to prove that your guess is correct. Guess: The following table suggests that a formula for f( may be f(n) n) n 0 1 2 3 4 5 f(n)