MIPS

12. We can calculate the greatest common divisor using a recurrence relation between numbers whereby 0 gcd (x, y) = gcd (y, x969) if y gcd(x, 0) x Given this, write the assembly code for the function gcd based upon this definition. Is this function a leaf, leaf with data, or non-leaf function? (Note: Specifics of this algorithms are available here: https://en.wikipedia.org/wiki/Recursion_(computer_science))