There is a mathematical expression for the factorial that we want to convert to RISCV 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 "Thursday Lab Section".

B$.(0\mathrm{.}5$ Points$)$ Print the character "Input:" and ask the user for an integer input then store it in x$10.$

C$.(2$ Points$)$ Write a code for the label $$recu$$ that adjusts stack pointer and stores the multiplication

result in x$10.$

D$.(1$ Point$)$ Write a code for the label $$fact$$ that checks if the $$inal result is ready.

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

F$.(1$ Point$)$ Test your code with the integer $8,$ and print the $$inal value of $$Factorial$=$ 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

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

Mathematical expression

The factorial of a non$-$negative integer $n$ is expressed as $n!$ and is defined as:

$nn(n-1)(n-2)$dots$21$