Problems Problem 4 (Euclid's Algorithm, Iterative Approach) Write an HMMM program god-iter. that takes two nonnegative integers z and y as iput and pits the greatest common divisor, cakculated iteratively using Euclid's Algorithm f y divides a the ged of a and y is y, otherwise, the ged of z and y is the same as the god of y and of z mod y, ie, in the next iteration y takes the place of z and z mod y takes the place u- Hints Read the inputs z and y into registers ri and 12 respectively, call the function f(a, y) that calculates the desired result in regjister rs, write the result halt In the function f(z, v), calculate gcd(z, g) in register ra return to the caller CA) s rt divisible by 2 7s8 juep to caller junp to CA) r2 rs mod r2