here we assume that however if bthen interchange and in the formula given above working assume and gcd( rem gcd( rem gcd( rem return return return programming example write program to calculate the gcd of two numbers using recursive functions #include int gcd(intint)int main(int num num resprintf("\ enter the two numbers")scanf("% % "&num &num )res gcd(num num )printf("\ gcd of % and % % "num num res)return int gcd(int xint yint remrem %yif(rem== return yelse return (gcd(yrem))output enter the two numbers gcd of and finding exponents we can also find exponent of number using recursion to find xythe base case would be when = as we know that any number raised to the power is thereforethe general formula to find xy can be given as exp (xy if = exp ( - )otherwise working exp_rec( exp_rec( exp_rec( exp_rec( exp_rec( exp_rec( exp_rec( exp_rec( exp_rec( exp_rec( exp_rec(