Python Please

Page of 3 ZOOM The Fibonacci sequence is one of the most famous formulas in mathematics. Each number in the sequence is the sum of the two numbers that precede it. So, the sequence goes: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, and so on. Let us denote in the nth term of Fibonacci sequence; in other words, F, = F.-2+ FR-1, where n could be any positive integer. Fo= 0 and 1=1 are predefined. Write a function, named fibSeries, to compute the nth term of Fibonacci series, with the following header: def fibSeries (n) : Its parameter n is a non-negative integer. The function should return F... the nth term of Fibonacci series. The terms of Fibonacci series is enumerated below: F1 = 1 F2 = Fo+F F, = F,+ F2 F4 = Fz+F Fs = P3 + F1 For example, the function call of fibSeries (6) would return 8. You might want to use the following template as your starting point: # compute Fibonacci series def main() # get n Page