Find a recurrence relations and initial conditions for the number of bit strings of length n that do not contain three consecutive zeros . please explain fully that how you calculate or get the initial conditins.such as a0 = 1 , a1 = 2 and a2 = 4 . please explain how you get a0 , a1 and a2 .