The greatest common divisor (GCD) of two positive integers a and b is the largest integer that evenly divides both a and b. In this problem, you will find the GCD of a positive integer and the factorial of a non-negative integer.
Create a class FactorialGCD with method factGCD which takes an int a and an int b as parameters and returns the GCD of a! (the factorial of a) and b.
|-||Assume 0! = 1.|
|-||a will be between 0 and 2147483647, inclusive.|
|-||b will be between 1 and 2147483647, inclusive.|