in c++ language please

2. Prompt the user to input two positive integer a and b.

(40pts) Write a recursive function int gcd(int a, int b) to calculate the greatest common divisor (GCD) of a and b (assuming a < b).

(20pts) The function gcd(a,b) should print out the list of partial results of the module operations and the final result of gcd(a,b).

For example, a = 19, b = 83, the output of your program should be:

83 mod 19 = 7

19 mod 7 =5

7 mod 5 = 2

5 mod 2 = 1

2 mod 1 = 0

gcd(82,19) = 1