GCD algorithm $($I NEED ASSEMBLE LANGUAGE, MIPS, NOT CHAT GPT PLEASE MAKE SURE ITS WORKING FINE AS MIPS CODE

Analyze the shift and division applications

Implement multiplication and division instructions into a program

Create one program with all parts below. Be sure to copy your program into a $.$txt file for submission, with the output at the bottom. DON'T USE ANY CONDITIONAL CONTROL FLOW DIRECTIVES.

A$.$ The greatest common divisor $($GCD$)$ of two integers is the largest integer that will evenly divide both integers. Implement a function using the GCD algorithm that involves integer division in a loop, described by the following pseudocode:

C$.$ Put all of this in a loop that performs the GCD $3$ times. Make sure one of the times uses negative numbers to test the absolute value.

If you have any questions, you can post them on the discussion board or send me an email. You can email me programs to look at and provide help, at any time.

Keep it up$!$