Implement an efficient function in Java that returns the nth (n ≤ 90) Fibonacci number. Example: fib(9) = 34. long fib(int n) to implement this function you must use one auxiliary stack and you should not make any assumptions about how the stack is implemented. (b.2) What is the running time complexity of your function? Justify.

1. view> toolbar> reviewing2.  right click on any  toolbar> reviewing3.  double click on  trk    in the status bar

Hypothesis: volumes of both figures are equal.the volume of  figure 1 is: .the volume of figure 2 is: .since , you can conclude that and . so, .volumes of figures are equal only when an angle in the basis is right (then figures will be the same), in another cases volume of figure 1 is less than volume of figure 2.the hypothesis was not correct in all cases.