Assembly MIPS

Name your assembly language source code file hw3-4-s. The greatest common divisor (GCD) of two integers a and b is the largest (most positive) integer g that divides both a and 6. We say that a number n divides m if the remainder after dividing m by n is zero. Euclid's algorithm^1 is an elegant way to calculate the GCD of two integers. Here is the algorithm in pseudo code. a and b can be negative integers and one. but not both, of them can be zero. Since GCD(a, b) is the largest (most positive) integer that divides both a and b, it will be a positive integer. It is true that GCD(a, b) = GCD(\a, |6) so we start by setting x to be the larger (by absolute value) of a and b, and y to the smaller. For this exercise, you are to write a complete MIPS32 assembly language program that displays prompts asking the user to enter values for a and b. The program shall compute and display GCD(a, b). Here is a sample run: make your program work similarly