$1.$ Consider a function sumSquare that, when given an integer $\backslash ($ n $\backslash ),$ returns the summation below. If $\backslash ($ n $\backslash )$ is not positive, then the function returns $0.$ The function sumSquare should call a procedure Square to calculate the square of each term in the summation:

$\backslash [$

n$^\{2\}+($n$-1)^\{2\}+($n$-2)^\{2\}+\backslash$ldots$+1^\{2\}$

$\backslash ]$

A$)$ Write the C codes for the functions sumSquare and Square. $[5]$

B$)$ Write the RISC$-$V assembly codes for sumSquare and Square with the assumption that data and instruction words are $32$ bits wide, memory is byte addressable, and Stack Pointer $($SP$)$ will have to be used. Make assumptions as you see fit, but state and explain them clearly. Your assembly code should start from a main function which will call the sumSquare function, which in turn will call the Square function. The control of execution once Square ends, will have to move back to the function sumSquare, and then on its completion to the main thread. $[25]$

C$)$ Assume instruction word addresses of your choice and point out the contents of the PC $($program counter$)$ and SP for every line of assembly code. $[5]$