In the following C function, let n $\ge$ m. ```c Int gcd ...

Multiple choice

In the following C function, let n ^$\ge$m.

Int gcd (n,m) { 
  if (n% m ==0) return m;
  n = n %m;
  return gcd (m, n);
}

How many recursive calls are made by this function?

Reveal answer Fill a bubble to check yourself

In the following C function, let n $\ge$ m. Int gcd (n,m) { if (n% m ==0) return m; n = n %m; return gcd (m, n); } How many recursive calls are made by this function?