The algorithm of Figure $10\mathrm{.}5$ always produces a string of four

characters independent of the sign and magnitude of the integer being

converted. Devise an algorithm that eliminates unnecessary characters

in common representations, that is$,$ an algorithm that does not store

leading $0$s nor a leading $+$ sign Figure $10\mathrm{.}5$ Binary$-$to$-$ASCII conversion subroutine.