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.

Please see attachment

Explanation:

Please see attachment

okay, so i know we just goofed around in that chat, but ive been like genuinly depressed, like medically depressed for almost 4 years now. i had my first panic attack when i was 8. i woke my mum up and told her i felt like i was in a dream. like i was a goldfish in a bowl, looking at all these things going on around me and feeling . tiny. wort hless. and i now am now 17 y/o. i still feel those emotions daily. life used to go by so quick.like every day i would wake up and just like want to go back to bed cause i always felt like i was in the wrong place. i guess looking back, i was in the wrong state of mind. i took a expensive like nice trip to whyoming with my grandfather and ha ted it. like idk why. i would have loved it now, but i found myself writing in a journal everyday because i would forget what happened the day before, couldnt remember what i ate for like the previous meal. just my memory left me for the week i was there. worst feeling ive ever experienced.