Help this question in MIPS Assembly Language.

Double precision operation.

Implementing $C=b+a,b$ and a are from the input of the user. The result should be printed out by

your code. All the input and output are in double precision. Please show your code and the

results.

Recursive function

Recursive function is the fundamental for algorithms such as divide and conquer, dynamic

programming, etc. The following function sheds lights on how the recursive function works. You

are expected to implement $f(x)$ function in MIPS using stack and calculate the results of $f(10).$

$f(x)=\{\begin{array}{cc}2f(x-1)+3,& x>0\\ 1,& x=0\end{array}$

Hint: the parameter is $x.$ save the parameters $x($$$a0)$ and return address $($ $$ra$ to the stack when

the function was called.

Example:

$F(0)=1$

$F(1)=2**f(0)+3=5$

$F(2)=2**f(1)+3=13$

$F(3)=2**f(2)+3=29$

$F(4)=2**f(3)+3=61$

$F(5)=2**f(4)+3=125$

$F(6)=2**f(5)+3=253$