3. Suppose that we are working on a hypothetical Marc-24 computer. It stores normalize binary floating-point numbers in the form(-l)'(l./)x(10)t. The first bit s stores the sign of the number and the bit t stores the sign of the exponent. The largest exponent 127 represents infinity and the smallest exponent -127 represents zero. Truncation will be used instead of rounding when necessary 15 bits 7 bits (a) How will the number 13.75 be stored? (b) How will the number 0.2 be stored? (Hint: (0.2) D-(0.001 1),) (c) For (b), what is the error between the stored value and true value? What is the relative error? (leave your answer in fraction) (d) What is the largest and the smallest position numbers can be correctly represented on this computer