(15 points) Consider a miniature binary computer whose floating-point words consist of 4 binary (i.e., base-2) digits for the mantissa and 3 binary digits for the exponent (plus sign bits). Let 3 (1011)2 X 2, 3 (1100)2 2. (1) Mark in the provided table whether the machine operation indicated (with the result Z assumed normalized) is exact, rounded (i.e., subject to nonzero rounding error), overflows, or underflows. Show your work. rounded overflow underflow Operation exact Z = fl(r y) Z = fl((x y)*) Z = fl(r + y) = f(y + (x/2)) = fl(r+ (y/16)) (15 points) Consider a miniature binary computer whose floating-point words consist of 4 binary (i.e., base-2) digits for the mantissa and 3 binary digits for the exponent (plus sign bits). Let 3 (1011)2 X 2, 3 (1100)2 2. (1) Mark in the provided table whether the machine operation indicated (with the result Z assumed normalized) is exact, rounded (i.e., subject to nonzero rounding error), overflows, or underflows. Show your work. rounded overflow underflow Operation exact Z = fl(r y) Z = fl((x y)*) Z = fl(r + y) = f(y + (x/2)) = fl(r+ (y/16))