Please use C99 standard to implemet.

Please use C99 standard to implemet.

Task 4 Read in and compute the greatest common divisor (GCD) of two natural numbers using recursion GCD(x, y) is the greatest natural number which divides both x and y GCD(6, 7) = 1 GCD(6, 9) = 3 GCD(6,0) = 6 Note that your program should contain a main function, which does 10 and a recursive function, int GCD(int x, int y), which computes the GCD of x and y. Task 4 (Cont.) You can build your recursion as follows. Given x>=y, Base, if y=0: GCD(x,0) = x Step, if y>0: GCD(x, y) = GCD(y, x % y) For example, GCD(9, 6) = GCD(6, 3) = GCD(3,0) = 3