Welcome to Bytelearn!

Let’s check out your problem:

$$B(n)=2^{n}$$$\newline$A binary code word of length $n$ is a string of $0$ 's and $1$ 's with $n$ digits. For example, $1001$ is a binary code word of length $4$ . The number of binary code words, $B(n)$, of length $n$, is shown. If the length is increased from $n$ to $n+1$, how many more binary code words will there be?$\newline$Choose $1$ answer:$\newline$(A) $2$$\newline$(B) $2^{n}$$\newline$(C) $2^{n+1}$$\newline$(D) $4^{n}$