0:00
Hi.
00:01
So here for the a part, we have the first case as the bit string is a sequence beginning with 1.
00:30
Then the bit string of length n minus 1 has a .n.
00:46
Minus 1 possible strings that contain the string 0 .1.
01:06
Second case, it will be that the bit string is a sequence, is a sequence.
01:25
Starting with k zeros followed by a 1.
01:39
So there are 2 raise to n minus k plus of minus 1 bit string whose length is n minus k minus 1.
01:58
Thus there are 2 raise to n minus k minus 1 bit strings.
02:14
With k zeros followed by a 1 and then followed by a bit that is n minus k minus 1.
02:32
We have the third case that is the bit string is a sequence ending in 0 1.
02:43
This is a sequence ending in 0 1.
02:51
So there are 2 raise 2 n minus 2 bit strings of length n minus 2.
03:04
Thus there are 2 raised to n minus 2 bit strings of length n minus 2 followed by 0 1...