def recursive_func(glist, m, n, i=0): # basecase if i ==…

Question Answered step-by-step def recursive_func(glist, m, n, i=0): # basecase if i ==… Image transcription textQuestion 6 (10 points) : De?ne a recursive function that takes a list of positive integers glist and two positiveintegers m and n as parameters. Your function should return a new list of integers that contain all the numbersin the given list that are between m and n, including m and n if they are part of the given list. The n… Show more… Show moredef recursive_func(glist, m, n, i=0): # basecase if i == len(glist): return [] # recursive list = recursive_func(glist, m, n, i + 1) if m <= glist[i] <= n: list.append(glist[i]) return list YOU DON'T NEED TO SOLVE IT. Just explain how my code answers the question in words. Essentially, add comments and tell me how this code works. Computer Science Engineering & Technology Python Programming CSC 247 Share QuestionEmailCopy link Comments (0)