Write a recursive assembly subroutine that calculates the following Fibonnaci number: 𝑓(𝑛) = { 0 1 &#119

[answerhappygod]

Write a recursive assembly subroutine that calculates the
following Fibonnaci number: 𝑓(𝑛) = { 0 1 𝑓(𝑛 − 1) + 𝑓(𝑛 − 2) 𝑖𝑓 𝑛 =
0 𝑖𝑓 𝑛 = 1 𝑜𝑡ℎ𝑒𝑟𝑤𝑖𝑠𝑒 Please test the subroutine by passing the
value of n equals 6. The result should equal 8. If n equals 4, the
result is 3. Do you use local variables, how do you manage them?
How do you pass the parameter n to the subroutine and how does the
subroutine return the result?