Do this in Assembly MIPS. Thank you!

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); 4. Implement a recursive function that calculates nth number in the Catalan number sequence. Catalan number sequence occurs in various counting_problems. The sequence can be recursively defined by the following equation. 7t G-1 and Cn+,- GG.' for n > 0, i-0 The template file (lab3.s) with test is provided to you. Download it from here. Remember you are only allowed to make modifications in the marked blocks