Part 1: Problem 1: Information Encoding In class we learned that in order to uniquely identify one of N equally likely symbols, ceiling(log2 N) bits of information must be communicated. For each of the questions in this Part, assume that the set of symbols/values given is the only information that needs to be represented a. How many bits are necessary to encode an integer in the range of 0 to 70 (inclusive)? bits b. How many bits are necessary to encode an integer in the range of 1 to 1024 (inclusive)? bits c. How many bits are necessary to encode an integer in the range of -32 to 31 (inclusive)? bits d. Consider a novelty playing card deck, with 12 suits of 5 cards each. How many bits are necessary to encode a card's suit (ignoring number value)? bits For the same novelty card deck, how many bits are necessary to encode a card's number (ignoring suit)? e. -bits f. For the same novelty card deck, how many bits are necessary to encode the full deck, considering both suit and number value? bits