Write a C++ code for calculating the GCD (Greatest Common Divisor) between two positive integer numbers. You should use Euclid's original subtraction based GCD algorithm ( not using modulo operator). You should write a function following the prototype below: int GCD(int a, int b)