$3.)$ Modify the following decimal addition algorithm. $SO,$ that it does not print out non$-$sisnificant leading zeroes; that is$,$ the answer would appear as $178$ rather than $0178.$

Figure $1\mathrm{.}2$ Algorithm for adding two m$-$digit numbers

$1$

Given: $m1$ and two positive numbers each containing $m$ digits, $a_{m-1}{a}_{m-2}dots{a}_4$ and $b_{n-1}{b}_{n-2},b_0$

Wanted: $c_n{c}_{n-1}{c}_{n-2}dots{c}_8$ where $($:$b_{m-2},dots{b}_j\}$

Algorithm:

Step $1$ Set the value of cany to $0$

Step $2$ Set the value of i to $0$

Step $3$ While the value of $1$ is less than or equal to $m=1,$ repeat the instruc: tions in Steps $4$ through $6$

Step $4$

Step $5$

Step $6$

Step $7$

Step $8$

Step $9$

Add the two digits $a,$ and $b,$ to the current value of carry to get $c_i$ If $c_{2}10,$ then reset $c_1$ to $(c_3-10)$ and reset the value of carry to $1$: otherwise, set the new value of carry to $0$

Add $1$ to $l$ effectively moving one column to the left

Set $c_m$ to the value of carry

Print out the final answer, $C_m{C}_{m-1}{C}_{m-2}dots{C}_S$

Stop