Create a python recursive function for the relation in #1. b. create a python program that uses a for loop to repeatedly invoke the recursive function you created and to print each term up to and including a6. in your hw document include a screen shot of the python file that contains your function code and your program code. include a screen shot of your idle output1) find the first 6 terms of the recurrence relation given by a1 = -1, an = 2n – an-1