A hypothetical machine uses a floating-point number set that stores numbers using 9 binary bits. The first bit holds the sign of the number, the next 4 hold the sign and magnitude of the exponent, and the final 4 bits store the mantissa. What will the base-10 equivalents of the following be? a) 101011011 b) 010111100 What is the worst-case scenario round-off error for the system in Problem 1 if rounding is employed? For the system described in Problem 1: a) What is the base -10 equivalent of the smallest positive number that can be stored? b) What is the base -10 equivalent of the largest number that can be stored