(Solved) : Hello Need Help Question Java Pseudo Code Class Discussed Two Versions Fibonacci Number Ca Q31337570 . . . .

hello , I need help with this question(java and pseudo code)

In class, we discussed about the two versions of Fibonaccinumber calculations: BinaryFib(n) and LinearFibonacci(n) (refer toyour slides and the text book). The first algorithm has exponentialtime complexity, while the second one is linear.

a) In this programming assignment, you will design an algorithm(in pseudo code), and implement (in Java), two recursive versionsof an Oddonacci calculator (similar to the ones of Fibonacci) andexperimentally compare their runtime performances. Oddonaccinumbers are inspired by Fibonacci numbers but start with threepredetermined values, each value afterwards being the sum of thepreceding three values. The first few Oddonacci