Question: using the racket programming language write a function ie gcd...

using the racket programming language, write a function i.e (gcd a b) that computes the greatest common divisor of two integers using the Euclidean Algorithm. you may assume a is greater than 0 and b is greater than or equal to 0.

Thank you!