Part 1.3 Recursvie functions In Nios II assembly, write an ABI-compliant recursive function that calculates the Fibonacci sequence for a given input index number. The Fibonacci sequence is defined as the sum of the previous two numbers in the sequence, with the first two numbers being 0 and 1 (i.e. fibonacci(n) - fibonacc), with fibonacci(0) 0 and fibonacci(1) 1). Thus, for example, if given index 0, your function should return 0. Input index 1 should return 1 and input index 7 should return 13. Your function's type signature should look like int fibonacci(int n) in-1) + fibonacci(n-2 2 Part 1.3 Recursvie functions In Nios II assembly, write an ABI-compliant recursive function that calculates the Fibonacci sequence for a given input index number. The Fibonacci sequence is defined as the sum of the previous two numbers in the sequence, with the first two numbers being 0 and 1 (i.e. fibonacci(n) - fibonacc), with fibonacci(0) 0 and fibonacci(1) 1). Thus, for example, if given index 0, your function should return 0. Input index 1 should return 1 and input index 7 should return 13. Your function's type signature should look like int fibonacci(int n) in-1) + fibonacci(n-2 2