[ C++ Language ]

Write a function that will implement each Fibonacci number with the help of an integer array of size 100 (elements of this array will be digits of the Fibonacci number).

When the function is called to find F_N, it will calculate all Fibonacci NFnumbers from F₂ to F_N using the basic formula: F_N = F_(N-1) + F_(N-2).

To add two Fibonacci numbers, the function will add elements of two arrays corresponding to F_(N-1) and F_(N-2) and store their sums in the array corresponding to F_N. (You are NOT supposed to store ALL arrays.)

Calculate Fibonacci numbers containing up to 100 digits. Display the biggest Fibonacci number that has less than 100 digits. Make sure that your program will display the error message when a Fibonacci number has 100 digits or more.

Include commentary.

[ C++ Language ]