Consider the following code for Euclid's algorithm int gcd (int m, int n) { while (n = 0) { } int rem m % n; m = n; n = rem; return m; } Rewrite the code using recursion. (6 P.)