Challenge: Compute Sum of N Fibonacci Numbers

Problem statement

In Mathematics, the Fibonacci sequence or series is defined as a series of numbers in which each number is the sum of the two preceding numbers. The simplest is the series $1, 1, 2, 3, 5, 8$, etc.

• In the given findTheSum function, the number n is passed as an argument where n represents the number of Fibonacci numbers starting from 1 that we want to compute the sum of.