You are correct.
How many binary strings of length 10 starts with 0 bit and ends with two 11 bits.
So, This is what ive done thus far.
0XXXXXXX11.
X can be either 1 or 0.
So, because first digit and last 2 cant change, my n = 7, is this correct?
Since we can have 2 different characters in each position (0 or 1), we have 2^7 different strings that start with 0 and end with 11.
Can somebody tell me if im right path here please!