Your task is to generate a recursive formula to solve each of the story problems given below. Give the recursive equation at the top of your answer (do not forget your base case(s)) and then show your work / thought process after. How many ways are there to climb a staircase with n-stairs if you can walk up the stairs 1 or 2 at a time? How many n-letter words can be created from an unlimited supply of a's, bs, and c's, if each word MUST contain an even number of a's