Write a recursive function gcd(int a, int b) that returns the greatest common divisor using Euclid's algorithm: if b == 0 return a, otherwise return gcd(b, a % b). Call it with 48 and 36 and print the result:

12

Print with %d.