Problem 6 (4 points). Consider the following Euclidean algorithm for computing the greatest common divisor of two integers a, b > 0: 1. function Euclid(a, b) 2. while b>0 3. 4. be a mod b; 5. at; 6. Assume a > b. Prove that the algorithm terminates in O(log a) iterations. return a