(Solved): Cryptography. 6.5. Using the basic form of Euclid's algorithm, compute the greatest common divisor o ...

6.5. Using the basic form of Euclid's algorithm, compute the greatest common divisor of 1. 7469 and 2464 2. 2689 and 4001 For this problem use only a pocket calculator. Show every iteration step of Euclid's algorithm, i.e., don't write just the answer, which is only a number. Also, for every gcd, provide the chain of gcd computations, i.e., $\gcd \left(r_0,r_1\right)=\gcd \left(r_1,r_2\right)=?$