answer in c++

1. Write a program that uses the recursive function to calculate GCD by using Euclid's algorithm. a) Request integer values for a and b from the console in main(t. b) The recursive function accepts integers a and b as input parameters. e) The function returns the GCD of a and b using Euclid's algorithm. d) The function prints statement to display the process (see output). e) Trace the recursive process for this function. Euclid's GCD Algorithm: a) CCD(a,b)=GCD(b, a mod b) b) GCD(a,0)=a Recall the process of thinking recursively. a) Determine the repetitive steps (recursive task). b) Determine a cond'ztion to end the repetition (base case). User 1 nput can be any content and 1t s bold and italicized for olarity. Example Output Enter two positive integers: 2016 2016 40