$6\mathrm{.}1$ In Algorithm $6\mathrm{.}1,$ prove thatgcd$($r$0,$ r$1)=$ gcd$($r$1,$ r$2)==$ gcd$($rm$1,$ rm$)=$ rmand, hence, rm $=$ gcd$($a$,$ b$).$