onsider a base$-5$ normalized, floating$-$point number system with chopping. Assume that

a hypothetical computer using this system has the following word representation,

se e$1$ e$2$ sm d$1$ d$2$ d$3$ d$4$

where sm is the sign of the mantissa, se is the sign of the exponent $(1$ for negative, $0$ for positive$),$ di are the digits of the mantissa, and ej are the digits of the exponent. How many distinct decimal values can be represented with this system?