(Solved) : Fibonacci Sum Problem Consult Rest Methods Biginteger Api Documentation Needed Solve Follo Q37196204 . . . .

Fibonacci Sum problem

Consult the rest of the methods of BigInteger from its APIdocumentation as needed to solve the following problem.

public static List fibonacciSum(BigInteger n)

Fibonacci numbers, that dusty and tired example of sillyrecursion in teaching introductory computer science, turn out havemore interesting combinatorial properties that make up goodproblems for us to solve. Relevantly for the current moment, anypositive integer n can be broken down exactly one way as a sum ofdistinct Fibonacci numbers that add up to n, under the additionalconstraint that no two consecutive Fibonacci numbers appear in thissum. (After all, if the sum contains two consecutive Fibonaccinumbers Fi and