1. (10 pts) Given that the method for finding the Fibonacci number is implemented as follows, how many times is the fib method invoked for fib(6)? Show your work for credits. /* The method for finding the Fibonacci number " public static long fib(long index) { if (index 0) // Base case else if (index1) // Base case else I/ Reduction and recursive calls return 0; return 1 return fib(index - 1) + fib (index - 2)