This final problem is similar to Exercise 6 on (p.83), at the end of Section 2.5. First take a look at the statement and solution for this problem: 6. The maximum values of the Java primitive types int and long are 2311 and 2631, respectively. Find the smallest n for which the nth Fibonacci number is not going to fit in a memory allocated for a. the type int. b. the type long. Solution of the text problem: a. The question is to find the smallest value of n such that F(n)>2311. Using the formula F(n)=51n rounded to the nearest integer, we get (approximately) the following inequality: 51n>2311orn>5(2311). After taking natural logarithms of both hand sides, we obtain n>lnln(5(2311))46.3. Thus, the answer is n=47. b. Similarly, we have to find the smallest value of n such that F(n)> 2631. Thus, 51n>2631,orn>5(2631) or, after taking natural logarithms of both hand sides, n>lnln(5(2631))92.4. Thus, the answer is n=93. Now solve this problem not from text: We are using a supercomputer in which integers are represented on 128 bits. What is the largest n for which the Fibonacci number F(n) does fit in the memory allocated? - Note well: The text problem is asking for the first number that does not fit. This problem is asking for the last number that does fit