For a hypothetical $7-$bit decimal $($base$-10)$ computer which uses $1$ bit for sign of exponent, $1$ bit for magnitude of exponent, $1$ bit for sign of mantissa and $4$ bits for magnitude of mantissa, determine the smallest positive number that can be represented exactly