a) Find the recurrence relation satisfied by Sn, where Sn is the number of regions into which three-dimensional space is divided by n planes if every three of the planes meet in one point, but no four of the planes go through the same point, b) Find Sn using iteration. | Numerade

a) Find a recurrence relation for the number of bit strings of length n that contain a pair of consecutive 0 s. b) What are the initial conditions? c) How many bit strings of length seven contain two consecutive 0s? | Numerade