In class we learned that in order to uniquely identify one of N equally likely symbols,

ceiling $(2)$ bits of information must be communicated. Answer the questions below: $(1\mathrm{.}5$ pts; $0\mathrm{.}5$pt for each$)$a$.$ b$.$ c$.$

$2.$ Two$$s a$.$

b$.$

How many bits are necessary to encode an integer in the range of $0$ to $256($inclusive$)?$

How many bits are necessary to encode an integer in the range of $0$ to $375($inclusive$)?$

How many bits are necessary to encode an integer in the range of $-120$ to $130($inclusive$)?$