Question $2)(7\mathrm{.}5$ Points$)$ There is an algorithm for calculating the GCD $($greatest common divisor$)$ of two

numbers that we want to convert to RISC$-$V using recursion. We expect to see a snapshot of your OUT window

like the one below. Follow the steps:

A$.(0\mathrm{.}5$ Points$)$ Print to the OUT Window in RVS the following string "Friday Lab Section".

B$.(1$ Point$)$ Print characters "Input$1$:$"$ and "Input$2$:$"$ and ask the user for two integers, one at a time, then

store them in $x1$ and $x,$ respectively.

C$.(0\mathrm{.}5$ Points$)$ define and initiate auxiliary registers with proper values.

D$.(2$ Points$)$ Write a code for the label $"$gcd$"$ that instantiates a recursive function for calculating the

greatest common divisor.

E$.(1$ Point$)$ Write a code for the label "end" that breaks compiling procedure.

F$.(1$ Point$)$ Test your code with integers $\text{'}119\text{'}$ and $\text{'}68\text{'},$ and print the final value of $"GCD="$ as the result.

G$.(1\mathrm{.}5$ Points$)$ Write a report based on your code in the report box, and upload both the assembly code

$(2$Q$2\_$Ans.asm$)$ and a snapshot $(2$Q$2\_$Snapshot$)$ of the RISC$-$V OUT window.

Greatest common divisor algorithm

Input$1$ must be greater than input$2$:

GCD $($input$1,$ input$2)\{$

If $($input$2=0)$ then return input$1$;

Otherwise: return GCD $($input$2,$ remainder of $($input$1/$ input$2)$;

Hint: You need a few more registers as auxiliary variables.