Need to generate a recursive formula to the story problem given below. Give the recursive equation at the top of your answer (do not forget your base case(s)) and then show your thought process after. Question: How many n-letter "words" can be created from an unlimited supply of a’s, b’s, and c’s, if each word MUST contain an even number of a’s?
