PLEASE USE MIPS

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) if b 0 return a; else return gcd(b, a mod b)