Question $1)(7\mathrm{.}5$ Points$)$ There is a piece of C $($and its equivalent Matlab$)$ code that we want to convert to RISC$-$V$.$ 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 "Student's number:" followed by your student number. If your student number is $123456789,$ the printed line will be: Student$$s number: $123456789$ B$.(0\mathrm{.}5$ Points$)$ Print the string "Input an integer:" and ask the user for an integer input then store it in x$1.$ C$.(2$ Points$)$ Write a code for the label $$loop$1$ that calculates the integer values of x$3$ and x$4.$ D$.(1$ Point$)$ Write a code for the label $$loop$2$ that updates the values of x$7$ and x$4.$ E$.(1$ Point$)$ Write a code for the label $$end$$ that breaks compiling procedure. F$.(1$ Point$)$ Test your code with the integer $5,$ and print the final value of x$4$ 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$1\_$Ans.asm$)$ and a snapshot $(2$Q$1\_$Snapshot$)$ of the RISC$-$V OUT window. C code for $($x$7=1$; x$7$ x$1+1$; x$7++)\{$ for $($x$8=1$; x$8$ x$1$; x$8++)\{$ x$3=$ x$7*$ x$8$; x$4=$ x$3+$ x$4$;$\}$ x$4=$ x$4+10$; $\}$ Matlab code for x$7=1$:$1$:x$1$ for x$8=1$:$1$: x$1-1$ x$3=$ x$7*$ x$8$; x$4=$ x$3+$x$4$; end x$4=$ x$4+10$; end RISC$-$V OUT window 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 x$1$ and x$2,$ 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 $119$ and $68,$ 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.