Using the recursive GCD method given below, show how it will recursive find out the GCD of 53 and 11.

public static int gcd(int x, int y)

{ if (x % y == 0)

return y;

else

return gcd(y, x % y);

}