How can I calculate the recursive calls to this function and what will be the correct answer to it?

How can I calculate the recursive calls to this function and what will be
the correct answer to it?

How can I calculate the recursive calls to this function and what will be
the correct answer to it??????
int func(x,y)
{
if (n % m == 0) return m;
n = n % m;
return func(y,x);
}
I need a formula for it or an explanation or general expression for it
really confused here?????