Let s(n) be the number of binary strings of length n that avoid the substring 111 meaning there are no 3 consecutive bits that are all 1. for example, if n=5 then 01101 avoids the substring 111 but 01110 does not avoid the substring 111. compute t(0), t(1), t(2), t(3), t(4) by writing down all the strings.