I have a question:
and I'm really confused on how recurrence relation works mathematically so i gave it a shot.
(i) r1 = 2 r2 = 4 r3 = 7 r4 = 12 (ii) #I'm not sure if (i) is correct hence, i couldn't do this part.
Since the question says the number of binary strings of length n that DO NOT contain three consecutive 1s, does it mean i have to list out all the possibilities? I'm terribly bad at recurrence and having trouble understanding part (i)