a) Show that, regardless of the initial n-bit value of the accumulator, the fused multiply-add result of two n-bit natural-number operands is always representable in 2n bits. Now, suppose n = 16. Starting from the largest possible FMA result, what is the hexadecimal representation of the largest n = 16-bit number that can still be added without producing overflow