In the following assignments, please follow the recommended register use conventions from slide $14$ of the Harris presentation, e$.$g$.$ arguments are passed in x$12-$x$17,$ return values are in x$10-$x$11,$ the stack pointer uses x$2,$ and have the stack grow from an initial address of $0$x$7$FFFEFFC.

Write a RISC$-$V program that calculates the first n Fibonacci numbers and stores them to memory addresses starting at $0$x$10010004.$ Specify the input n as a value stored in address $0$x$10010000.$ Which is the largest value of n where the Fibonacci number is not exceeding the value that can be stored in a register?