What is the number of different binary strings (strings computed by {0,1}) of length 2n that can be composed by combining strings 1001 and 10?
1) I do not understand the question
2) What is the address of your original post?