In Matlab

Q3) The greatest common divisor of two integers a & b is the largest integer that divides both numbers without remainder, and the function to compute it is denoted by GCD(a,b). The GCD function can be written recursively. If b 0, then a is the greatest common divisor. Otherwise, GCD(a,b) GCD(b, rem(a.b) where rem(a.b) is the remainder of a divided by b. Write a recursive function with header [ged]-myGCD(a,b) that computes the greatest common divisor of a & b. Assume that a & b are scalar integers. Test Cases: >>gcd myGCD(10,4) gcd- 2 god myGCD(33,121) S> > god myGCD(18,1) gcd Q4) Can you write an iterative GCD function