$[20]$ Q$1$: Express the following numbers in $10-$bit floating point format. In this representation $5$

bits are reserved for mantissa and $4$ bits are reserved for the exponent and $1$ bit is reserved for

the sign of the number. For the exponent take bias $=7$

Roundoff to the nearest possible representable binary number if the number cannot be stored

exactly.

$[10]$ a$)$

$(-0\mathrm{.}0011111111{)}_2$

$[10]$ b$)$

$(121\mathrm{.}700{)}_{10}[20]$ Question $1$: Express the following numbers in $10-$bit floating point format. In this representation $5$ bits are reserved for mantissa and $4$ bits are reserved for the exponent and $1$ bit is reserved for the sign of the number. For the exponent take bias $\backslash (=7\backslash )[5]$ d$)$ How big can the number $\backslash ($ c $\backslash )$ be such that the result of the following calculation is numerically $0$ in this $10-$bit floating point format $?\backslash [8+$c$-8=0\backslash ]$