1 Implement the following C code in LEGv8 Assume that X0 hol

1) Implement the following C code in LEGv8. Assume that X0 holds the input value of n and X19 holds the output of the function.

Int fib(int n){

---------if (n == 0)

----------------return 0,

--------else if (n == 1)

---------------return 1;

--------else

---------------return fib (n - 1) + fib (n – 2);

Solution

CODE: