do it with basic c programming 2 3

2. Write a function gcd (m, n) that calculates the greatest common divisor of the integers m and n. 3. Write a recursive version of the god (m, n) function in question 2. Hint: if n is 0, return m. otherwise call ged recursively, passing n as first argument and n%m as the second