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. Imagine a parking garage with n car spaces. Type A cars take up 1 space. Type B and type C cars take up 2 spaces. Given an unlimited number of each kind of car, how many arrangements of cars on n-spaces are there (order matters as it is an arrangement)? How many ways are there to pair off 2n people for tennis matches? Express this function in terms of f(n), where n is the number of PAIRS and 2n is the number of people. 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. Imagine a parking garage with n car spaces. Type A cars take up 1 space. Type B and type C cars take up 2 spaces. Given an unlimited number of each kind of car, how many arrangements of cars on n-spaces are there (order matters as it is an arrangement)? How many ways are there to pair off 2n people for tennis matches? Express this function in terms of f(n), where n is the number of PAIRS and 2n is the number of people