Write an HMMM program gcd_iter.hmmm that takes two nonnegative integers x and y as input and prints their greatest common divisor, calculated iteratively using Euclids Algorithm: if y divides x, the gcd of x and y is y; otherwise, the gcd of x and y is the same as the gcd of y and x mod y, ie, in the next iteration y takes the place of x and x mod y takes the place of y.

Problem 4. (Euclid's Algorithm, lterative Approach) Write an HMMM program ged iter.n that takes two nonnegative integers z and y as input and prints their greatest common divisor, calculated iteratively using Euelid's Algorithm: if y divides z, the ged of z and y is y: ot herwise, the ged of and y is the same as the ged of y and mod y, ie, in the next iteration y talas the place ofandmod y tales the place of y. python3 hmmAssembler.py -f ged.iter .hmo gediter.b $ python3 hmSimulator py-f ged iter.b -n 54 24 8 s python3 hmamSimulator.py f gcd_iter.b n 45 Problem 4. (Euclid's Algorithm, lterative Approach) Write an HMMM program ged iter.n that takes two nonnegative integers z and y as input and prints their greatest common divisor, calculated iteratively using Euelid's Algorithm: if y divides z, the ged of z and y is y: ot herwise, the ged of and y is the same as the ged of y and mod y, ie, in the next iteration y talas the place ofandmod y tales the place of y. python3 hmmAssembler.py -f ged.iter .hmo gediter.b $ python3 hmSimulator py-f ged iter.b -n 54 24 8 s python3 hmamSimulator.py f gcd_iter.b n 45