Question: Write a program to find Greatest Common Divisor(GCD) of two numbers using recursion. Explanation: Rule 01: if(b==0) return GCD(a,b)=a;