Assuming we implemented a recursive function Fibonacci(n), which will compute the Fibonacci number based on: Fibonacci(n) = Fibonacci(n-1) + Fibonacci(n-2); and Fibonacci(1) = 0, Fibonacci(2) = 1; then how many function calls to Fibonacci() need to be made if we want to compute Fibonacci(5).

Hey i really need some solving this problem: 1. encrypt this binary string into cipher text: 110000. include in your answer the formula the decoder would use to decrypt your cipher text in the format (coded answer) x n mod (m) = y & 2. decrypt this cipher text into a binary string: 106 you.