Exercise $1\mathrm{.}4$ Bits n$\text{'}$ BytExercise $1\mathrm{.}4$ Bits n$\text{'}$ Bytes$$

A bit is a single binary digit, $0$ or $1.$ It turns out that there are exactly

distinct sequences of

bits. For example

$,$ and there are exactly eight three$-$bit sequences:

$000$

$001$

$010$

$011$

$100$

$101$

$110$

$111$

A byte is a sequence of eight bits. For example the sequence $00100100$ represents a single byte.

Write a program named bits$\_$n$\_$bytes.py that takes integer input from the user representing some number of bytes, then prints a message describing the corresponding number of bits and the number of distinct sequences of that length. For example, if the input is $2,$ the output is:

There are $16$ bits in $2$ bytes, with $65536$ possible sequences.

In order to get credit for this question, your solution must use only one print statement.

Hint: You'll need to use the exponent operator: $**.$ For example, we can calculate

$($i$.$e$.,2$ to the $6$th power$)$ in Python as follows:es$$

A bit is a single binary digit, $0$ or $1.$ It turns out that there are exactly

distinct sequences of

bits. For example

$,$ and there are exactly eight three$-$bit sequences:

$000$

$001$

$010$

$011$

$100$

$101$

$110$

$111$

A byte is a sequence of eight bits. For example the sequence $00100100$ represents a single byte.

Write a program named bits$\_$n$\_$bytes.py that takes integer input from the user representing some number of bytes, then prints a message describing the corresponding number of bits and the number of distinct sequences of that length. For example, if the input is $2,$ the output is:

There are $16$ bits in $2$ bytes, with $65536$ possible sequences.

In order to get credit for this question, your solution must use only one print statement.

Hint: You'll need to use the exponent operator: $**.$ For example, we can calculate

$($i$.$e$.,2$ to the $6$th power$)$ in Python as follows: