Algorithm question

.

(a) Use a recursion tree to show that S(n) = (g(n)), for some function g(n).

(b) Use induction to prove that S(n) = (g(n)).

s(n) = 35) + 6