For this exercise, construct a function to take a number. The end result should be the sum of numbers in the Fibonacci sequence (https://en.wikipedia.org/wiki/Fibonacci_number) up to the specified number you entered. The first few numbers of the sequence are [1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89]. Each number is the sum of the previous two numbers; for example, f[6] = 13 because f[5] = 8 and f[4] = 5, and thus f[6] = 8+5 = 13. You can use the starter code at https://github.com/PacktPublishing/Hands-on-JavaScript-for-Python-Developers/tree/master/chapter-5/fibonacci/starter-code. Don't worry too much about the most efficient algorithms for calculating the number; just be sure not to hardcode values and instead rely on the input variables and the formula.
United States
Great Britain
India
Germany
France
Canada
Russia
Spain
Brazil
Australia
South Africa
Thailand
Ukraine
Switzerland
Slovakia
Luxembourg
Hungary
Romania
Denmark
Ireland
Estonia
Belgium
Italy
Finland
Cyprus
Lithuania
Latvia
Malta
Netherlands
Portugal
Slovenia
Sweden
Argentina
Colombia
Ecuador
Indonesia
Mexico
New Zealand
Norway
South Korea
Taiwan
Turkey
Czechia
Austria
Greece
Isle of Man
Bulgaria
Japan
Philippines
Poland
Singapore
Egypt
Chile
Malaysia