Reference no: EM133397703

Questions: 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. 1. 2. 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-Ietter "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? 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 ?n), where n is the number of PAIRS and Zn is the number of people. . Imagine a piece of paper with n crossing lines how many regions of area are there? The constraints are that no lines are ever parallel and no more than two lines intersect at any single point. Imagine a binary sequence (0's and 1's) that is n-digits long. How many of these n-digit sequences exist if the sequences cannot contain consecutive 1's? Imagine 2n points on a circle (so there are n-pairs of points). How many ways can you pair points with line segments without having any line segments that intersect? Express your function f(n), in terms of the number of pairs.