4. The Euclid algorithm for determining GCD of two integers a and b (assuming a > b) was given iteratively in Homework 1. The same algorithm can be written recursively, by following these two steps: Base step: If b = 0, return a Else return GCD(b, a mod b) Where a mod b is written in C++ as: a %b It computes the remainder when a is divided by b You need to write a C++ program that uses this function and from main send values of a and b, and make sure a is greater than b, prior to calling the function GCD