Consider a floating point representation with a sign bit, a 5 bit exponent and a 10 bit significand. Assume the exponent uses excess M representation with an offset of 15. Assume the significand uses an implied 1 leading bit. a. What is the largest integer that can be represented in this format? b. What is the smallest positive integer that can be represented? c. How many base 10 digits are accurately represented? d. What number is represented by 0010100010111010? 7. 8. Consider a set of valid codes from a much large set of possible codes. The distance between two codes is the number of bits in which the two codes differ, and the Hamming distance is the minimal distance between any two valid codes. Why is this far more useful than the average distance between any two valid codes? 9 The following is a Hamming code: 011 1101011 000 110 10 10. assuming an error in only 1 bit, what is the correct code? Does it contain an error? If so, and 10. When using Hamming codes to encode a very long binary message, typically the message is broken into a number of small chunks, each of which is encoded separately. There is a trade-off between using long chunks and short chunks. What is the primary advantage of using longer chunks? What is the advantage of using short chunks? What is the one key factor that would be used to decide the size chunk to use