Problem 2: (20 Marks) Write a recursive MIPS program to compute Greatest Common Divisor (GCD) of two positive integers X and Y. Take X and Y input from the user using I/O operation as given in Problem1.asm. An algorithm to compute GCD of X and Y is given below: If X or Y = 0 then GCD (X,Y) = 0 If X = Y then GCD (X, Y) = X else if X