Need help making this function recursivley using the MIPS assembly language.

3. Implement a function to calculate the GCD (Greatest Common Divisor) of two given positive integers recursively using the following algorithm def gcd(a, b) return a; else return gcd(b, a mod b)