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.

Assume the existence of a bankaccount class. define a derived class, savingsaccount that contains two instance variables: the first a double, named interestrate, and the second an integer named interesttype. the value of the interesttype variable can be 1 for simple interest and 2 for compound interest. there is also a constructor that accepts two parameters: a double that is used to initialize the interestrate variable, and a string that you may assume will contain either "simple", or "compound", and which should be used to initialize the interesttype variable appropriately. there should also be a pair of functions getinterestrate and getinteresttype that return the values of the corresponding data members (as double and int respectively).

To check spelling errors in a document, the word application uses the to determine appropriate spelling. internet built-in dictionary user-defined words other text in the document

What are the things you are considering before uploading photos on social media?