(Choose 1 answer)
When applying the recursive algorithm for computing gcd(4, 14), how many times is the function god called?
procedure gcd(a, b: nonnegtive integers with a < b)if a = 0 then gcd(a, b): = b;else gcd(a,b): = gcd(b mod a, a);
A. 3
B. 2
C. 4
D. None of the other choices is correct
Q: 9
