Consider the recurrence relation that is defined by the following piecewise function:

(a) Write a snippet of Python code that implements it as a method, F(n).

(b) Show how the function call, F(6), is broken down by the recursion and the result is subsequently built back up.

(c) Write a snippet of Python code that iteratively (i.e. using a loop) generates a list containing the first seven terms of the sequence. Do not use a list comprehension! Do not call the function that you created in part (a) (i.e., perform manual calculations for each term in the loop). The list of terms is already delcared and initialized for you.

terms = [ ]

If n= 1 F(n) - F n-1+2n , otherwise