Suppose s is the set of bit strings recursively defined by: 001 ∈ s b ∈ s → 11b ∈ s b ∈ s → 10b ∈ s b ∈ s → 1b ∈ s. let cn the number of bit strings in s of length n for n ≥ 2. this problem superficially looks very similar to problem 2, only the 3rd recursion rule is slightly different. • would be cn the same as an in problem 2 for all integer n, n ≥ 2? • can we use the same idea to construct a recurrence relation for cn that we used in problem 2 for an? explain your answer for each question. (hint: find a5 and c5.)