10. (10 points) Write a recursive C function that computes the greatest common divisor of two integers. The greatest common divisor (gcd) of two integers a and b is given by: if b 0; if a > b and b > 0, gcd(a, b)- - gcd (b, a%b) where the symbol % is the modulo operator in C/C++ (that is, a%b gives the remainder when a is divided by b) Give the sequence of recursive calls when ged(333,185) is invoked. What is the result of gcd(333, 185)? 10. (10 points) Write a recursive C function that computes the greatest common divisor of two integers. The greatest common divisor (gcd) of two integers a and b is given by: if b 0; if a > b and b > 0, gcd(a, b)- - gcd (b, a%b) where the symbol % is the modulo operator in C/C++ (that is, a%b gives the remainder when a is divided by b) Give the sequence of recursive calls when ged(333,185) is invoked. What is the result of gcd(333, 185)