Question 1176882
.
At an annual board meeting company X is deciding whether or not to take the company public. 
Each board member can vote “yes”, “no”, or “abstain.” If there are n-board members, 
then how many different ways can the votes be cast? Express your answer as a recursive function, f(n). 
Do not forget to include any necessary base case(s).
~~~~~~~~~~~~~~~~~~~~~~~



It is much easier to get / (to write) the final formula, than the recursive formula.


For n members in the board, the full set of possible answers has {{{3^n}}} elements.
It is OBVIOUS, since there are 3 possible answers foe each member, and these answers are independent for members.



So, the request to write a recursive function is unnecessary complication of the problem.